description: The new generation external memory contains an array of integers a[1 … n] = [a_1, a_2, …, 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: 
  
    1. You may select arbitrary indices l and r (1 ≤ l < r ≤ n) as the boundaries of the segment. 
    2. Then you replace the segment a[l … r] with it's cyclic shift to the left by an arbitrary offset d. The concept of a cyclic shift can be also explained by following relations: the sequence [1, 4, 1, 3] is a cyclic shift of the sequence [3, 1, 4, 1] to the left by the offset 1 and the sequence [4, 1, 3, 1] is a cyclic shift of the sequence [3, 1, 4, 1] to the left by the offset 2. 
  
  
  
  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 … 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.
  
  Input
  
  The first line contains an integer t (1 ≤ t ≤ 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 ≤ n ≤ 50) — the length of the array. The second line consists of space-separated elements of the array a_i (-10^9 ≤ a_i ≤ 10^9). Elements of array a may repeat and don't have to be unique.
  
  Output
  
  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 offset value. Please remember that only the cyclic shifts to the left are considered so the chosen segment will be shifted by the offset d to the to the left.
  
  Note that you are not required to find the minimum number of cyclic shifts needed for sorting. Any sorting method where the number of shifts does not exceed n will be accepted.
  
  If the given array a is already sorted, one of the possible answers is k = 0 and an empty sequence of cyclic shifts.
  
  If there are several possible answers, you may print any of them.
  
  Example
  
  Input
  
  
  4
  2
  2 1
  3
  1 2 1
  4
  2 4 1 3
  5
  2 5 1 4 3
  
  
  Output
  
  
  1
  1 2 1
  1
  1 3 2
  3
  2 4 1
  2 3 1
  1 3 2
  4
  2 4 2
  1 5 3
  1 2 1
  1 3 1
  
  Note
  
  Explanation of the fourth data set in the example: 
  
    1. The segment a[2 … 4] is selected and is shifted to the left by 2: [2, \color{blue}{5, 1, 4}, 3] \longrightarrow [2, \color{blue}{4, 5, 1}, 3] 
    2. The segment a[1 … 5] is then selected and is shifted to the left by 3: [\color{blue}{2, 4, 5, 1, 3}] \longrightarrow [\color{blue}{1, 3, 2, 4, 5}] 
    3. After that the segment a[1 … 2] is selected and is shifted to the left by 1: [\color{blue}{1, 3}, 2, 4, 5] \longrightarrow [\color{blue}{3, 1}, 2, 4, 5] 
    4. And in the end the segment a[1 … 3] is selected and is shifted to the left by 1: [\color{blue}{3, 1, 2}, 4, 5] \longrightarrow [\color{blue}{1, 2, 3}, 4, 5] 
solution:     import java.io.BufferedReader;
      import java.io.FileInputStream;
      import java.io.FileNotFoundException;
      import java.io.IOException;
      import java.io.InputStreamReader;
      import java.util.*;
  
      import javax.print.attribute.HashAttributeSet;
  
      import java.io.PrintStream;
              
                  public class Solution {
  
                      public static boolean Local(){
                          try{ 
                              return System.getenv("LOCAL_SYS")!=null;
                          }catch(Exception e){
                              return false;
                          }
                      }   
  
                      public static boolean LOCAL;
  
                      static class FastScanner {
  
                              BufferedReader br;
                              StringTokenizer st ;
  
                              FastScanner(){
                                  br =  new BufferedReader(new InputStreamReader(System.in));
                                  st = new StringTokenizer("");
                              }
  
                              FastScanner(String file) {
  
                                  try{
                                      br =  new BufferedReader(new InputStreamReader(new FileInputStream(file)));
                                      st = new StringTokenizer("");
                                  }catch(FileNotFoundException e) {
                                      // TODO Auto-generated catch block
                                      System.out.println("file not found");
                                      e.printStackTrace();
                                  }
                                  
                              }
                              
  
                              String next() {
                                  while (!st.hasMoreTokens())
                                      try {
                                          st = new StringTokenizer(br.readLine());
                                      } catch (IOException e) {
                                      }
                                  return st.nextToken();
                              }
  
                              int nextInt() {
                                  return Integer.parseInt(next());
                              }
  
                              long nextLong() {
                                  return Long.parseLong(next());
                              }
                              String readLine() throws IOException{
                                  return br.readLine();
                              }
                          }
                                              
                      static class Pair<T,X> {
  
                          T first;
                          X second;
                          
                          Pair(T first,X second){
                              this.first = first;
                              this.second = second;
                          }
  
                          @Override
                          public int hashCode(){
                              return Objects.hash(first,second);
                          }
  
                          @Override
                          public boolean equals(Object obj){
                              return obj.hashCode() == this.hashCode();
                          }
  
                      }
  
                  
                  static PrintStream debug = null;
                  
                  
                  static long mod = (long)(Math.pow(10,9) + 7); 
                  
  
                  public static void main(String[] args) throws Exception {
                      
                      FastScanner s = new FastScanner();
  
                      LOCAL = Local();
  
                      
                      if(LOCAL){
                          s = new FastScanner("src/input.txt");
                          PrintStream o = new PrintStream("src/sampleout.txt");
                          debug = new PrintStream("src/debug.txt");
                          System.setOut(o);
                      }
  
                      long mod = 1000000007;
  
                  
  
                  
                      int tcr = s.nextInt();                  
                      
                      StringBuilder sb = new StringBuilder();
  
                      for(int tc=0;tc<tcr;tc++){
                          
                          int n = s.nextInt();
  
                          long arr[] = new long[n];
  
                          for(int i=0;i<n;i++){
                              arr[i] = s.nextLong();
                          }
  
                          TreeMap<Long,Deque<Integer>> map = new TreeMap<>();
  
                          for(int i=0;i<n;i++){
                              Deque<Integer> q = map.getOrDefault(arr[i],new LinkedList<>());
                              q.addLast(i);
                              map.put(arr[i],q);
                          }
  
                          int last_index = n - 1;
  
                    
                          StringBuilder sbr = new StringBuilder();
                          int oper = 0;
  
                          while(map.size() > 0){
                              long last_elem = map.lastKey();
                              int cnt = map.get(last_elem).size();
                              int index = map.get(last_elem).pollLast();
                              for(int i=last_index;i>=0;i--){
                                  if(arr[i] == last_elem){
                                      index = i;break;
                                  }
                              }
  
                              if(index != last_index){
                                  leftShift(arr,index, last_index);
  
                                  sbr.append((index + 1)+" "+(last_index + 1)+" "+1+"\n");
  
                                  oper++;
                              }
                              if(cnt==1){
                                  map.pollLastEntry();
                              }
                              last_index--;
                          }
  
                          sb.append(oper+"\n");
                          sb.append(sbr);
                          
  
  
  
  
                      }
  
                      print(sb.toString());
                  }
  
                  public static void leftShift(long arr[],int l,int r){
                     // println(l+" "+r);
                      if(r - l + 1 == 1){return;}
                      long ar[] = new long[r - l + 1];
                      for(int i=l;i<=r;i++){
                          ar[i-l] = arr[i];
                      }
                      int index = 1;
                      for(int i=l;i<=r;i++){
                          arr[i] = ar[index];
                          index = (index + 1) % ar.length;
                      }
                  }
  
                  public static List<long[]> prime_factors(long n){
              
                      List<long[]> list = new ArrayList<>();
                      
                      for(long i=2;i<=(Math.sqrt(n));i++){
              
                          if(n % i == 0){
                              
                              int cnt = 0;
                              
                              while( (n % i) == 0){
                                  n = n/i;
                                  cnt++;
                                  
                              }
              
                              list.add(new long[]{i,cnt});
                          }
                      }
  
              
                      if(n!=1){
                          list.add(new long[]{n,1l});
                      }
              
                      return list;
              
                  }
  
                  public static boolean check(int arr[]){
                      for(int i=1;i<arr.length;i++){
                          if(arr[i] < arr[i-1]){
                              return false;
                          }
                      }
                      return true;
                  }
  
              
                  public static boolean inRange(int r1,int r2,int val){
                      return ((val >= r1) && (val <= r2));
                  }
  
                  static int len(long num){
                      return Long.toString(num).length();
                  }
  
                  static long mulmod(long a, long b,long mod)
                  {
                      long ans = 0l;
                      
                      while(b > 0){
                          long curr = (b & 1l);
                          if(curr == 1l){
                              ans = ((ans % mod) + a) % mod;
                          }
                          
                          a = (a + a) % mod;
  
                          b = b >> 1;
                      }
  
                      return ans;
                  }
  
  
                  public static void dbg(PrintStream ps,Object... o) throws Exception{
                      if(ps == null){
                          return;
                      }
                      Debug.dbg(ps,o);
                  }
  
                  public static long modpow(long num,long pow,long mod){
  
                      long val = num;
                      long ans = 1l;
  
                      while(pow > 0l){
                          
                          long bit = pow & 1l;
  
                          if(bit == 1){
                              ans = (ans * (val%mod))%mod;
                          }
  
                          val = (val * val) % mod;
                          pow = pow >> 1;
                      }
  
                      return ans;
  
                  }
  
                  public static char get(int n){
                      return (char)('a' + n);
                  }
  
                  public static long[] sort(long arr[]){
                      List<Long> list = new ArrayList<>();
                      for(long n : arr){list.add(n);}
                      Collections.sort(list);
                      for(int i=0;i<arr.length;i++){
                          arr[i] = list.get(i);
                      }
                      return arr;
                  }
  
                  public static int[] sort(int arr[]){
                      List<Integer> list = new ArrayList<>();
                      for(int n : arr){list.add(n);}
                      Collections.sort(list);
                      for(int i=0;i<arr.length;i++){
                          arr[i] = list.get(i);
                      }
                      return arr;
                  }
  
                  // return the (index + 1)
                  // where index is the pos of just smaller element
                  // i.e count of elemets strictly less than num
                  public static int justSmaller(long arr[],long num){
                      //  System.out.println(num+"@");
                      int st = 0;
                      int e = arr.length - 1;
              
                      int ans = -1;
              
                      while(st <= e){
              
                          int mid = (st + e)/2;
              
                          if(arr[mid] >= num){
                              e = mid - 1;
                          }else{
                              ans = mid;
                              st = mid + 1;
                          }
              
                      }
              
              
                      return ans + 1;
              
                  }
                  public static int justSmaller(int arr[],int num){
                      //  System.out.println(num+"@");
                      int st = 0;
                      int e = arr.length - 1;
              
                      int ans = -1;
              
                      while(st <= e){
              
                          int mid = (st + e)/2;
              
                          if(arr[mid] >= num){
                              e = mid - 1;
                          }else{
                              ans = mid;
                              st = mid + 1;
                          }
              
                      }
              
              
                      return ans + 1;
              
                  }
                  
                  //return (index of just greater element)
                  //count of elements smaller than or equal to num
  
                  public static int justGreater(long arr[],long num){
                      int st = 0;
                      int e = arr.length - 1;
              
                      int ans = arr.length;
              
                      while(st <= e){
                          
                          int mid = (st + e)/2;
              
                          if(arr[mid] <= num){
                              st = mid + 1;
                          }else{
                              ans = mid;
                              e = mid - 1;
                          }
                      }
              
                      return ans;
              
                  }
  
                  public static int justGreater(int arr[],int num){
                      int st = 0;
                      int e = arr.length - 1;
              
                      int ans = arr.length;
              
                      while(st <= e){
                          
                          int mid = (st + e)/2;
              
                          if(arr[mid] <= num){
                              st = mid + 1;
                          }else{
                              ans = mid;
                              e = mid - 1;
                          }
                      }
              
                      return ans;
              
                  }
              
                  
  
                  public static void println(Object obj){
                      System.out.println(obj.toString());
                  }
  
                  public static void print(Object obj){
                      System.out.print(obj.toString());
                  }
  
                  public static int gcd(int a,int b){
                      if(b == 0){return a;}
                      return gcd(b,a%b);
                  }
  
                  public static long gcd(long a,long b){
                      if(b == 0l){
                          return a;
                      }
  
                      return gcd(b,a%b);
                  }
  
                  public static int find(int parent[],int v){
                      if(parent[v] == v){
                          return v;
                      }
                      
                      return parent[v] = find(parent, parent[v]);
                  }
  
              
  
                  public static List<Integer> sieve(){
                  
                          List<Integer> prime = new ArrayList<>();
  
                          int arr[] = new int[100001];
  
                      Arrays.fill(arr,1);
  
                      arr[1] = 0;
                      arr[2] = 1;
  
                      for(int i=2;i<=100000;i++){
                          
                          if(arr[i] == 1){
                              
                              prime.add(i);
  
                              for(long j = (i*1l*i);j<100001;j+=i){
                                  arr[(int)j] = 0;
                              }
                          }
                      }
  
                      return prime;
                  }
  
                  static boolean isPower(long n,long a){
                      
                      long log = (long)(Math.log(n)/Math.log(a));
  
                      long power = (long)Math.pow(a,log);
  
                      if(power == n){return true;}
  
                      return false;
                  }
  
  
                  private static int mergeAndCount(int[] arr, int l,int m, int r)
                  {
  
                      // Left subarray
                      int[] left =  Arrays.copyOfRange(arr, l, m + 1);
  
                      // Right subarray
                      int[] right = Arrays.copyOfRange(arr, m + 1, r + 1);
  
                      int i = 0, j = 0, k = l, swaps = 0;
  
                      while (i < left.length && j < right.length) {
                          if (left[i] <= right[j])
                              arr[k++] = left[i++];
                          else {
                              arr[k++] = right[j++];
                              swaps += (m + 1) - (l + i);
                          }
                      }
                      while (i < left.length)
                          arr[k++] = left[i++];
                      while (j < right.length)
                          arr[k++] = right[j++];
                      return swaps;
                  }
  
                  // Merge sort function
                  private static int mergeSortAndCount(int[] arr, int l,int r)
                  {
  
                      // Keeps track of the inversion count at a
                      // particular node of the recursion tree
                      int count = 0;
  
                      if (l < r) {
                          int m = (l + r) / 2;
  
                          // Total inversion count = left subarray count
                          // + right subarray count + merge count
  
                          // Left subarray count
                          count += mergeSortAndCount(arr, l, m);
  
                          // Right subarray count
                          count += mergeSortAndCount(arr, m + 1, r);
  
                          // Merge count
                          count += mergeAndCount(arr, l, m, r);
                      }
  
                      return count;
                  }
  
                  static class Debug{
                      //change to System.getProperty("ONLINE_JUDGE")==null; for CodeForces
                      public static final boolean LOCAL = System.getProperty("ONLINE_JUDGE")==null;
  
                      
  
                      private static <T> String ts(T t) {
                          if(t==null) {
                              return "null";
                          }
                          try {
                              return ts((Iterable) t);
                          }catch(ClassCastException e) {
                              if(t instanceof int[]) {
                                  String s = Arrays.toString((int[]) t);
                                  return "{"+s.substring(1, s.length()-1)+"}\n";
                              }else if(t instanceof long[]) {
                                  String s = Arrays.toString((long[]) t);
                                  return "{"+s.substring(1, s.length()-1)+"}\n";
                              }else if(t instanceof char[]) {
                                  String s = Arrays.toString((char[]) t);
                                  return "{"+s.substring(1, s.length()-1)+"}\n";
                              }else if(t instanceof double[]) {
                                  String s = Arrays.toString((double[]) t);
                                  return "{"+s.substring(1, s.length()-1)+"}\n";
                              }else if(t instanceof boolean[]) {
                                  String s = Arrays.toString((boolean[]) t);
                                  return "{"+s.substring(1, s.length()-1)+"}\n";
                              }
                              try {
                                  return ts((Object[]) t);
                              }catch(ClassCastException e1) {
                                  return t.toString();
                              }
                          }
                      }
                      private static <T> String ts(T[] arr) {
                          StringBuilder ret = new StringBuilder();
                          ret.append("{");
                          boolean first = true;
                          for(T t: arr) {
                              if(!first) {
                                  ret.append(", ");
                              }
                              first = false;
                              ret.append(ts(t));
                          }
                          ret.append("}");
                          return ret.toString();
                      }
                      private static <T> String ts(Iterable<T> iter) {
                          StringBuilder ret = new StringBuilder();
                          ret.append("{");
                          boolean first = true;
                          for(T t: iter) {
                              if(!first) {
                                  ret.append(", ");
                              }
                              first = false;
                              ret.append(ts(t));
                          }
                          ret.append("}");
                          return ret.toString();
                      }
                      public static void dbg(PrintStream ps,Object... o) throws Exception {
                          if(LOCAL) {
                              System.setErr(ps);
                              System.err.print("Line #"+Thread.currentThread().getStackTrace()[2].getLineNumber()+": [");
                              for(int i = 0; i<o.length; i++) {
                                  if(i!=0) {
                                      System.err.print(", ");
                                  }
                                  System.err.print(ts(o[i]));
                              }
                              System.err.println("]");
                          }
                      }
                  }
  
          }