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.util.*;
  import java.io.*;
  import java.math.*;
  
  
  /**
   * @author Naitik
   * 
   */
  public class Main
  
  { 
  	 static FastReader sc=new FastReader(); 
  	 static long dp[][];
  	 static int mod=998244353;;
  //	 static int mod=1000000007;
  	 static long max;
  	 static long bit[];
  //	 static long seg[];
  //	 static long fact[];
  //	 static long A[];
  	// static TreeMap<Integer,Integer> map;
  	 static HashMap<Integer,Integer> map;
  	   static PrintWriter out=new PrintWriter(System.out);
  	  public static void main(String[] args)
  {
  		  
  		 //  StringBuffer sb=new StringBuffer("");
  		  int ttt=1;
  		      ttt =i();
  		      
  	        outer :while (ttt-- > 0) 
  			{
  	        	int n=i();
  	        	int A[]=input(n);
  	        	int ans=0;
  	        	StringBuffer sb=new StringBuffer("");
  	        	int B[]=copy(A);
  	        	sort(B);
  	        	for(int i=0;i<n;i++) {
  	        		if(A[i]==B[i]) {
  	        			continue;
  	        		}
  	        		
  	        		ArrayList<Integer> l=new ArrayList<Integer>();
  	        		l.add(A[i]);
  	        		for(int j=i+1;j<n;j++) {
  	        			if(A[j]==B[i]) {
  	        				ans++;
  	        				sb.append((i+1)+" "+(j+1)+" "+(j-i)+"\n");
  	        				A[i]=B[i];
  	        				int c=0;
  	        				for(int k=i+1;k<=j;k++) {
  	        					A[k]=l.get(c);
  	        					c++;
  	        				}
  	        				break;
  	        			}
  	        			l.add(A[j]);
  	        		}
  	        	}
  	        	System.out.println(ans);
  	        	System.out.println(sb.toString());
  	        	
  	        }
  	        //System.out.println(sb.toString());
  		     out.close();
  	     
  	     
  	    //CHECK FOR N=1                    //CHECK FOR M=0
          //CHECK FOR N=1                    //CHECK FOR M=0
         	//CHECK FOR N=1
         	
  		        
  		     
      }
  	 
  	  
  	
  static class Pair implements Comparable<Pair>
       {
      	 int x;
      	 int y;
      	 int z;
      	 Pair(int x,int y){
      		 this.x=x;
      		 this.y=y;
      		// this.z=z;
      		 
      	 }
  		@Override
  		public int compareTo(Pair o) {
  			if(this.x>o.x)
  				return +1;
  			else if(this.x<o.x)
  				return -1;
  			else {
  				if(this.y>o.y)
  					return 1;
  				else if(this.y<o.y)
  					return -1;
  				else
  					return 0;
  			}
  		}
  //		public int hashCode() 
  //		{ 
  //			final int temp = 14; 
  //			int ans = 1; 
  //			ans =x*31+y*13; 
  //			return ans; 
  //		} 
  //		@Override
  //		public boolean equals(Object o) 
  //		{ 
  //			if (this == o) { 
  //				return true; 
  //			} 
  //			if (o == null) { 
  //				return false; 
  //			} 
  //			if (this.getClass() != o.getClass()) { 
  //				return false; 
  //			} 
  //			Pair other = (Pair)o; 
  //			if (this.x != other.x || this.y!=other.y) { 
  //				return false; 
  //			} 
  //			return true; 
  //		} 	
  //		
  		/* FOR TREE MAP PAIR USE */
  		
  //		public int compareTo(Pair o) {
  // 			if (x > o.x) {
  // 				return 1;
  // 			}
  // 			if (x < o.x) {
  // 				return -1;
  // 			}
  // 			if (y > o.y) {
  // 				return 1;
  // 			}
  // 			if (y < o.y) {
  // 				return -1;
  // 			}
  // 			return 0;
  // 		}
  		
       }
  
  static int find(int A[],int a) {
  	  if(A[a]<0)
  		  return a;
  	  return A[a]=find(A, A[a]);
  }
  //static int find(int A[],int a) {
  //	  if(A[a]==a)
  //		  return a;
  //	  return A[a]=find(A, A[a]);
  //}
  //FENWICK TREE
  static void update(int i, int x){
  	for(; i < bit.length; i += (i&-i))
  		bit[i] += x;
  }
  
  static int sum(int i){
  	int ans = 0;
  	for(; i > 0; i -= (i&-i))
  		ans += bit[i];
  	return ans;
  }
  //END
  static void add(int v) {
  	if(!map.containsKey(v)) {
  		map.put(v, 1);
  	}
  	else {
  		map.put(v, map.get(v)+1);
  	}
  }
  static void remove(int v) {
  	if(map.containsKey(v)) {
  		map.put(v, map.get(v)-1);
  		if(map.get(v)==0)
  			map.remove(v);
  	}
  }
  public static int upper(int A[],int k,int si,int ei)
  {
  	int l=si;
  	int u=ei;
  	int ans=-1;
  	while(l<=u) {
  		int mid=(l+u)/2;
  		if(A[mid]<=k) {
  			ans=mid;
  			l=mid+1;
  		}
  		else {
  			u=mid-1;
  		}
  	}
  	return ans;
  }
  public static int lower(int A[],int k,int si,int ei)
  {
  	int l=si;
  	int u=ei;
  	int ans=-1;
  	while(l<=u) {
  		int mid=(l+u)/2;
  		if(A[mid]<=k) {
  			l=mid+1;
  		}
  		else {
  			ans=mid;
  			u=mid-1;
  		}
  	}
  	return ans;
  	
      
  }
  static int[] copy(int A[]) {
  	int B[]=new int[A.length];
  	for(int i=0;i<A.length;i++) {
  		B[i]=A[i];
  	}
  	return B;
  }
  static long[] copy(long A[]) {
  	long B[]=new long[A.length];
  	for(int i=0;i<A.length;i++) {
  		B[i]=A[i];
  	}
  	return B;
  }
  static int[] input(int n) {
  	int A[]=new int[n];
  	   for(int i=0;i<n;i++) {
  		   A[i]=sc.nextInt();
  	   }
  	   return A;
     }
  static long[] inputL(int n) {
  	long A[]=new long[n];
  	   for(int i=0;i<n;i++) {
  		   A[i]=sc.nextLong();
  	   }
  	   return A;
     }
  static String[] inputS(int n) {
  	String A[]=new String[n];
  	   for(int i=0;i<n;i++) {
  		   A[i]=sc.next();
  	   }
  	   return A;
     }
  static long sum(int A[]) {
  	long sum=0;
  	for(int i : A) {
  		sum+=i;
  	}
  	return sum;
  }
  static long sum(long A[]) {
  	long sum=0;
  	for(long i : A) {
  		sum+=i;
  	}
  	return sum;
  }
  static void reverse(long A[]) {
  	int n=A.length;
  	long B[]=new long[n];
  	for(int i=0;i<n;i++) {
  		B[i]=A[n-i-1];
  	}
  	for(int i=0;i<n;i++)
  		A[i]=B[i];
  	
  }
  static void reverse(int A[]) {
  	int n=A.length;
  	int B[]=new int[n];
  	for(int i=0;i<n;i++) {
  		B[i]=A[n-i-1];
  	}
  	for(int i=0;i<n;i++)
  		A[i]=B[i];
  	
  }
  static void input(int A[],int B[]) {
  	   for(int i=0;i<A.length;i++) {
  		   A[i]=sc.nextInt();
  		   B[i]=sc.nextInt();
  	   }
  }
  static int[][] input(int n,int m){
  	int A[][]=new int[n][m];
  	for(int i=0;i<n;i++) {
  		for(int j=0;j<m;j++) {
  			A[i][j]=i();
  		}
  	}
  	return A;
  }
  static char[][] charinput(int n,int m){
  	char A[][]=new char[n][m];
  	for(int i=0;i<n;i++) {
  		String s=s();
  		for(int j=0;j<m;j++) {
  			A[i][j]=s.charAt(j);
  		}
  	}
  	return A;
  }
  
  static int max(int A[]) {
  	int max=Integer.MIN_VALUE;
  	for(int i=0;i<A.length;i++) {
  		max=Math.max(max, A[i]);
  	}
  	return max;
  }
  static int min(int A[]) {
  	int min=Integer.MAX_VALUE;
  	for(int i=0;i<A.length;i++) {
  		min=Math.min(min, A[i]);
  	}
  	return min;
  }
  static long max(long A[]) {
  	long max=Long.MIN_VALUE;
  	for(int i=0;i<A.length;i++) {
  		max=Math.max(max, A[i]);
  	}
  	return max;
  }
  static long min(long A[]) {
  	long min=Long.MAX_VALUE;
  	for(int i=0;i<A.length;i++) {
  		min=Math.min(min, A[i]);
  	}
  	return min;
  }
  static long [] prefix(long A[]) {
  	long p[]=new long[A.length];
  	p[0]=A[0];
  	for(int i=1;i<A.length;i++)
  		p[i]=p[i-1]+A[i];
  	return p;
  }
  static long [] prefix(int A[]) {
  	long p[]=new long[A.length];
  	p[0]=A[0];
  	for(int i=1;i<A.length;i++)
  		p[i]=p[i-1]+A[i];
  	return p;
  }
  static long [] suffix(long A[]) {
  	long p[]=new long[A.length];
  	p[A.length-1]=A[A.length-1];
  	for(int i=A.length-2;i>=0;i--)
  		p[i]=p[i+1]+A[i];
  	return p;
  }
  static long [] suffix(int A[]) {
  	long p[]=new long[A.length];
  	p[A.length-1]=A[A.length-1];
  	for(int i=A.length-2;i>=0;i--)
  		p[i]=p[i+1]+A[i];
  	return p;
  }
  static void fill(int dp[]) {
  	Arrays.fill(dp, -1);
  }
  static void fill(int dp[][]) {
  	for(int i=0;i<dp.length;i++)
  	Arrays.fill(dp[i], -1);
  }
  static void fill(int dp[][][]) {
  	for(int i=0;i<dp.length;i++) {
  		for(int j=0;j<dp[0].length;j++) {
  			Arrays.fill(dp[i][j],-1);
  		}
  	}
  }
  static void fill(int dp[][][][]) {
  	for(int i=0;i<dp.length;i++) {
  		for(int j=0;j<dp[0].length;j++) {
  			for(int k=0;k<dp[0][0].length;k++) {
  			Arrays.fill(dp[i][j][k],-1);
  			}
  		}
  	}
  }
  static void fill(long dp[]) {
  	Arrays.fill(dp, -1);
  }
  static void fill(long dp[][]) {
  	for(int i=0;i<dp.length;i++)
  	Arrays.fill(dp[i], -1);
  }
  static void fill(long dp[][][]) {
  	for(int i=0;i<dp.length;i++) {
  		for(int j=0;j<dp[0].length;j++) {
  			Arrays.fill(dp[i][j],Long.MAX_VALUE);
  		}
  	}
  }
  static void fill(long dp[][][][]) {
  	for(int i=0;i<dp.length;i++) {
  		for(int j=0;j<dp[0].length;j++) {
  			for(int k=0;k<dp[0][0].length;k++) {
  			Arrays.fill(dp[i][j][k],-1);
  			}
  		}
  	}
  }
  static int min(int a,int b) {
  	return Math.min(a, b);
  }
  static int min(int a,int b,int c) {
  	return Math.min(a, Math.min(b, c));
  }
  static int min(int a,int b,int c,int d) {
  	return Math.min(a, Math.min(b, Math.min(c, d)));
  }
  static int max(int a,int b) {
  	return Math.max(a, b);
  }
  static int max(int a,int b,int c) {
  	return Math.max(a, Math.max(b, c));
  }
  static int max(int a,int b,int c,int d) {
  	return Math.max(a, Math.max(b, Math.max(c, d)));
  }
  static long min(long a,long b) {
  	return Math.min(a, b);
  }
  static long min(long a,long b,long c) {
  	return Math.min(a, Math.min(b, c));
  }
  static long min(long a,long b,long c,long d) {
  	return Math.min(a, Math.min(b, Math.min(c, d)));
  }
  static long max(long a,long b) {
  	return Math.max(a, b);
  }
  static long max(long a,long b,long c) {
  	return Math.max(a, Math.max(b, c));
  }
  static long max(long a,long b,long c,long d) {
  	return Math.max(a, Math.max(b, Math.max(c, d)));
  }
  
  static long power(long x, long y, long p)
  {
  
  	if(y==0)
  		return 1;
  	if(x==0)
  		return 0;
      long res = 1;
      x = x % p;
  
      while (y > 0) {
  
          if (y % 2 == 1)
              res = (res * x) % p;
  
          y = y >> 1; 
          x = (x * x) % p;
      }
  
      return res;
  }
  static long power(long x, long y)
  {
  
  	if(y==0)
  		return 1;
  	if(x==0)
  		return 0;
      long res = 1;
  
      while (y > 0) {
  
          if (y % 2 == 1)
              res = (res * x);
  
          y = y >> 1; 
          x = (x * x);
      }
  
      return res;
  }
  static void print(int A[]) {
  	for(int i : A) {
  		System.out.print(i+" ");
  	}
  	System.out.println();
  }
  static void print(long A[]) {
  	for(long i : A) {
  		System.out.print(i+" ");
  	}
  	System.out.println();
  }
  static long mod(long x) {
  	  return ((x%mod + mod)%mod);
  }
  static String reverse(String s) {
  	StringBuffer p=new StringBuffer(s);
  	p.reverse();
  	return p.toString();
  }
  
       static int i() {
      	 return sc.nextInt();
       }
       static String s() {
      	 return sc.next();
       }
       static long l() {
      	 return sc.nextLong();
       }  
       static void sort(int[] A){
          int n = A.length;
          Random rnd = new Random();
          for(int i=0; i<n; ++i){
              int tmp = A[i];
              int randomPos = i + rnd.nextInt(n-i);
              A[i] = A[randomPos];
              A[randomPos] = tmp;
          }
          Arrays.sort(A);
       }
       static void sort(long[] A){
  	        int n = A.length;
  	        Random rnd = new Random();
  	        for(int i=0; i<n; ++i){
  	            long tmp = A[i];
  	            int randomPos = i + rnd.nextInt(n-i);
  	            A[i] = A[randomPos];
  	            A[randomPos] = tmp;
  	        }
  	        Arrays.sort(A);
  	     }
    static String sort(String s) {
   	 Character ch[]=new Character[s.length()];
   	 for(int i=0;i<s.length();i++) {
   		 ch[i]=s.charAt(i);
   	 }
   	 Arrays.sort(ch);
   	 StringBuffer st=new StringBuffer("");
   	 for(int i=0;i<s.length();i++) {
   		 st.append(ch[i]);
   	 }
   	 return st.toString();
    }
    static HashMap<Integer,Integer> hash(int A[]){
  	  HashMap<Integer,Integer> map=new HashMap<Integer, Integer>();
  	  for(int i : A) {
  		  if(map.containsKey(i)) {
  			  map.put(i, map.get(i)+1);
  		  }
  		  else {
  			  map.put(i, 1);
  		  }
  	  }
  	  return map;
    }
    static TreeMap<Integer,Integer> tree(int A[]){
  	  TreeMap<Integer,Integer> map=new TreeMap<Integer, Integer>();
  	  for(int i : A) {
  		  if(map.containsKey(i)) {
  			  map.put(i, map.get(i)+1);
  		  }
  		  else {
  			  map.put(i, 1);
  		  }
  	  }
  	  return map;
    }
       static boolean prime(int n) 
  	    { 
  	        if (n <= 1) 
  	            return false; 
  	        if (n <= 3) 
  	            return true; 
  	        if (n % 2 == 0 || n % 3 == 0) 
  	            return false; 
  	        double sq=Math.sqrt(n);
  	  
  	        for (int i = 5; i <= sq; i = i + 6) 
  	            if (n % i == 0 || n % (i + 2) == 0) 
  	                return false; 
  	        return true; 
  	    } 
       static boolean prime(long n) 
  	    { 
  	        if (n <= 1) 
  	            return false; 
  	        if (n <= 3) 
  	            return true; 
  	        if (n % 2 == 0 || n % 3 == 0) 
  	            return false; 
  	        double sq=Math.sqrt(n);
  	  
  	        for (int i = 5; i <= sq; i = i + 6) 
  	            if (n % i == 0 || n % (i + 2) == 0) 
  	                return false; 
  	        return true; 
  	    } 
       static int gcd(int a, int b) 
       { 
           if (a == 0) 
               return b; 
           return gcd(b % a, a); 
       } 
       static long gcd(long a, long b) 
       { 
           if (a == 0) 
               return b; 
           return gcd(b % a, a); 
       } 
       
          
      static class FastReader 
      { 
          BufferedReader br; 
          StringTokenizer st; 
    
          public FastReader() 
          { 
              br = new BufferedReader(new
                       InputStreamReader(System.in)); 
          } 
    
          String next() 
          { 
              while (st == null || !st.hasMoreElements()) 
              { 
                  try
                  { 
                      st = new StringTokenizer(br.readLine()); 
                  } 
                  catch (IOException  e) 
                  { 
                      e.printStackTrace(); 
                  } 
              } 
              return st.nextToken(); 
          } 
    
          int nextInt() 
          { 
              return Integer.parseInt(next()); 
          } 
    
          long nextLong() 
          { 
              return Long.parseLong(next()); 
          } 
    
          double nextDouble() 
          { 
              return Double.parseDouble(next()); 
          } 
    
          String nextLine() 
          { 
              String str = ""; 
              try
              { 
                  str = br.readLine(); 
              } 
              catch (IOException e) 
              { 
                  e.printStackTrace(); 
              } 
              return str; 
          } 
      } 
  } 
  
  
  
  