B"For an array b of n integers, the extreme value of this array is the minimum number of times (possibly, zero) the following operation has to be performed to make b non-decreasing: For example, if b = [2, 4, 3] and index 2 gets selected, then the possible arrays after this operation are [2, underline{1}, underline{3}, 3] , [2, underline{2}, underline{2}, 3] , or [2, underline{3}, underline{1}, 3] . And consequently, for this array, this single operation is enough to make it non-decreasing: [2, 4, 3] rightarrow [2, underline{2}, underline{2}, 3] . It's easy to see that every array of positive integers can be made non-decreasing this way. YouKn0wWho has an array a of n integers. Help him find the sum of extreme values of all nonempty subarrays of a modulo 998 ,244 ,353 . If a subarray appears in a multiple times, its extreme value should be counted the number of times it appears. An array d is a subarray of an array c if d can be obtained from c by deletion of several (possibly, zero or all) elements from the beginning and several (possibly, zero or all) elements from the end. The first line contains a single integer t ( 1 <= t <= 10 ,000 ) -- the number of test cases. The first line of each test case contains a single integer n ( 1 <= n <= 10^5 ). The second line of each test case contains n integers a_1, a_2, ldots, a_n ( 1 <= a_i <= 10^5 ). It is guaranteed that the sum of n over all test cases doesn't exceed 10^5 . For each test case, print a single integer -- the sum of extreme values of all subarrays of a modulo 998 ,244 ,353 . Let f(l, r) denote the extreme value of [a_l, a_{l+1}, ldots, a_r] . In the first test case, [5, 4, 3] rightarrow [ underline{3}, underline{2}, 4, 3] rightarrow [3, 2, underline{2}, underline{2}, 3] rightarrow [ underline{1}, u"...