B'The new generation external memory contains an array of integers a[1 ldots n] = [a_1, a_2, ldots, a_n] . This type of memory does not support changing the value of an arbitrary element. Instead, it allows you to cut out any segment of the given array, cyclically shift (rotate) it by any offset and insert it back into the same place. Technically, each cyclic shift consists of two consecutive actions: For example, if a = [1, color{blue}{3, 2, 8}, 5] , then choosing l = 2 , r = 4 and d = 2 yields a segment a[2 ldots 4] = [3, 2, 8] . This segment is then shifted by the offset d = 2 to the left, and you get a segment [8, 3, 2] which then takes the place of of the original elements of the segment. In the end you get a = [1, color{blue}{8, 3, 2}, 5] . Sort the given array a using no more than n cyclic shifts of any of its segments. Note that you don 't need to minimize the number of cyclic shifts. Any method that requires n or less cyclic shifts will be accepted. The first line contains an integer t ( 1 <= q t <= q 1000 ) -- the number of test cases. The next 2t lines contain the descriptions of the test cases. The first line of each test case description contains an integer n ( 2 <= q n <= q 50 ) -- the length of the array. The second line consists of space-separated elements of the array a_i ( -10^9 <= q a_i <= q 10^9 ). Elements of array a may repeat and don 't have to be unique. Print t answers to all input test cases. The first line of the answer of each test case should contain an integer k ( 0 <= k <= n ) -- the number of actions to sort the array. The next k lines should contain descriptions of the actions formatted as " l r d " (without quotes) where l and r ( 1 <= l < r <= n ) are the boundaries of the segment being shifted, while d ( 1 <= d <= r - l ) is the offs'...