description: Alice and Bob play the following game. Alice has a set S of disjoint ranges of integers, initially containing only one range [1, n]. In one turn, Alice picks a range [l, r] from the set S and asks Bob to pick a number in the range. Bob chooses a number d (l ≤ d ≤ r). Then Alice removes [l, r] from S and puts into the set S the range [l, d - 1] (if l ≤ d - 1) and the range [d + 1, r] (if d + 1 ≤ r). The game ends when the set S is empty. We can show that the number of turns in each game is exactly n.
  
  After playing the game, Alice remembers all the ranges [l, r] she picked from the set S, but Bob does not remember any of the numbers that he picked. But Bob is smart, and he knows he can find out his numbers d from Alice's ranges, and so he asks you for help with your programming skill.
  
  Given the list of ranges that Alice has picked ([l, r]), for each range, help Bob find the number d that Bob has picked.
  
  We can show that there is always a unique way for Bob to choose his number for a list of valid ranges picked by Alice.
  
  Input
  
  Each test contains multiple test cases. The first line contains the number of test cases t (1 ≤ t ≤ 1000). Description of the test cases follows.
  
  The first line of each test case contains a single integer n (1 ≤ n ≤ 1000).
  
  Each of the next n lines contains two integers l and r (1 ≤ l ≤ r ≤ n), denoting the range [l, r] that Alice picked at some point.
  
  Note that the ranges are given in no particular order.
  
  It is guaranteed that the sum of n over all test cases does not exceed 1000, and the ranges for each test case are from a valid game.
  
  Output
  
  For each test case print n lines. Each line should contain three integers l, r, and d, denoting that for Alice's range [l, r] Bob picked the number d.
  
  You can print the lines in any order. We can show that the answer is unique.
  
  It is not required to print a new line after each test case. The new lines in the output of the example are for readability only. 
  
  Example
  
  Input
  
  
  4
  1
  1 1
  3
  1 3
  2 3
  2 2
  6
  1 1
  3 5
  4 4
  3 6
  4 5
  1 6
  5
  1 5
  1 2
  4 5
  2 2
  4 4
  
  
  Output
  
  
  1 1 1
  
  1 3 1
  2 2 2
  2 3 3
  
  1 1 1
  3 5 3
  4 4 4
  3 6 6
  4 5 5
  1 6 2
  
  1 5 3
  1 2 1
  4 5 5
  2 2 2
  4 4 4
  
  Note
  
  In the first test case, there is only 1 range [1, 1]. There was only one range [1, 1] for Alice to pick, and there was only one number 1 for Bob to pick.
  
  In the second test case, n = 3. Initially, the set contains only one range [1, 3]. 
  
    * Alice picked the range [1, 3]. Bob picked the number 1. Then Alice put the range [2, 3] back to the set, which after this turn is the only range in the set. 
    * Alice picked the range [2, 3]. Bob picked the number 3. Then Alice put the range [2, 2] back to the set. 
    * Alice picked the range [2, 2]. Bob picked the number 2. The game ended. 
  
  
  
  In the fourth test case, the game was played with n = 5. Initially, the set contains only one range [1, 5]. The game's turn is described in the following table. 
  
  Game turn| Alice's picked range| Bob's picked number| The range set after  
  ---|---|---|---  
  Before the game start| | |  \{ [1, 5] \}   
  1| [1, 5]| 3|  \{ [1, 2], [4, 5] \}  
  2| [1, 2]| 1|  \{ [2, 2], [4, 5] \}   
  3| [4, 5]| 5|  \{ [2, 2], [4, 4] \}   
  4| [2, 2]| 2|  \{ [4, 4] \}   
  5| [4, 4]| 4|  \{ \}  (empty set)
solution: // हर हर महादेव
  import java.util.*;
  import java.lang.*;
  import java.io.*;
  import java.math.BigInteger;
  import java.text.DecimalFormat;
  
  public final class Solution {
  
      static int inf = Integer.MAX_VALUE;
      static long mod = 1000000000 + 7;
    
   static void ne(Scanner sc, BufferedWriter op) throws Exception {
      int n=sc.nextInt();
      ArrayList<pair> list= new ArrayList<>();
      HashMap<Integer,Set<Integer>> hm = new HashMap<>();
      for(int i=0;i<n;i++){
          int l=sc.nextInt();
          int r=sc.nextInt();
          Set<Integer> st= hm.containsKey(l)?hm.get(l):new HashSet<>();
          st.add(r);
          hm.put(l,st);
          
          list.add(new pair(l,r));
      }
      int[] ans= new int[n];
      int[] v= new int[n+1];
      for(int i=0;i<n;i++){
          pair p= list.get(i);
          if(p.xx==p.yy){
              ans[i]=p.xx;
              // print(p.xx);
              v[p.xx]=-1;
              // print(ans[i]);
          }
      }
      for(int i=1;i<n+1;i++){
          if(v[i]!=-1){
              for(int j=0;j<list.size();j++){
                  boolean x=check(list.get(j),i,hm);
                  if(x && v[i]!=-1){
                      ans[j]=i;
                      v[i]=-1;
                      break;
                  }
              }
          }
      }
  
      for(int i=0;i<n;i++){
          pair p=list.get(i);
          op.write(p.xx+" "+p.yy+" "+ans[i]+"\n");
      }
      // op.write("\n");
      
  
   }
  
   public static boolean  check(pair p, int id, HashMap<Integer,Set<Integer>> hm){
       if(!(p.xx<=id &&  id<=p.yy)){
          return false;
       }
  
       pair one = new pair(p.xx,id-1);
       pair two= new pair(id+1,p.yy);
          //  print(one+" "+two);
        
       boolean f=false;
       boolean f2=false;
       if(hm.containsKey(one.xx) && hm.get(one.xx).contains(one.yy)){
           f=true;
       }
       if(hm.containsKey(two.xx) && hm.get(two.xx).contains(two.yy)){
           f2=true;
       }
       if(one.xx<=one.yy && two.xx<=two.yy){
          //  print(two);
           
           return f&&f2;
       }
       return f||f2;
  
  }
  
    
      
    
  
      public static void main(String[] args) throws Exception {
          BufferedWriter op = new BufferedWriter(new OutputStreamWriter(System.out));
          // Reader sc = new Reader();
       
          Scanner sc= new Scanner(System.in);
          int t = sc.nextInt();
          while (t-->0){ ne(sc, op); }
          
          // ne(sc,op);
             
                     
          op.flush();
      }
  
      static void print(Object o) {
          System.out.println(String.valueOf(o));
      }
      static int[] toIntArr(String s){
          int[] val= new int[s.length()];
          for(int i=0;i<s.length();i++){
              val[i]=s.charAt(i)-'a';
          }
          return val;
      }
  
      static void  sort(int[] arr){
          ArrayList<Integer> list= new ArrayList<>();
          for(int i=0;i<arr.length;i++){
              list.add(arr[i]);
  
          }
          Collections.sort(list);
          for(int i=0;i<arr.length;i++){
              arr[i]=list.get(i);
          }
      }
         static void  sort(long[] arr){
          ArrayList<Long> list= new ArrayList<>();
          for(int i=0;i<arr.length;i++){
              list.add(arr[i]);
  
          }
          Collections.sort(list);
          for(int i=0;i<arr.length;i++){
              arr[i]=list.get(i);
          }
      }
  
  }
  //NENENENENENENENE END MAIN CLASS NENENENENENENNENENE
  
  //  class seg  {
  //      int x1;
  //      int x2;
  //      int x3;
  //      int x4;
  //      public seg(int x1, int x2,int x3, int x4){
  //          this.x1=x1;
  //          this.x2=x2;
  //          this.x3=x3;
  //          this.x4=x4;
  //      }
  
  // //    @Override
  //     public boolean equals(seg obj)
  //     {
  //         if(x1==obj.x1 && x2==obj.x2 && x3==obj.x3 && x4==obj.x4){
  //             return true;
  //         }
  //         if(x1==obj.x3 && x2==obj.x4 && x3==obj.x1 && x4==obj.x2){
  //             return true;
  //         }
           
  //         return false;   
        
  //     }
  //     @Override
  //     public String toString(){
  //         return "[ "+x1+" "+x2+" "+x3+" "+x4+" ]";
  //     } 
           
  //     // @Override
  //     // public int hashCode(seg s){
  //     //     return super.hashCode();
  //     //     // int h=17;
  //     //     // Integer one=new Integer(s.x1);
  //     //     // Integer two=new Integer(s.x2);
  //     //     // Integer three=new Integer(s.x3);
  //     //     // Integer four=new Integer(s.x4);
  //     //     // h=31*h+one.hashCode();
  //     //     // h=31*h+two.hashCode();
  //     //     // h=31*h+three.hashCode();
  //     //     // h=31*h+four.hashCode();
  //     //     // return h;
  //     // }
     
  //  }
   
  
  // return -1 to put no ahed in array
  class pair {
      int  xx;
      int yy;
      pair(int xx, int yy ) {
          this.xx = xx;
          this.yy = yy;
      }
      public String toString(){
          return "["+xx+"-"+yy+"]";
      }
  }
  
  
  class sortY implements Comparator<pair> {
      public int compare(pair p1, pair p2) {
          if (p1.yy > p2.yy) {
              return 1;
          } else if (p1.yy == p2.yy) {
              if (p1.xx > p2.xx) {
                  return 1;
              } else if (p1.xx < p2.xx) {
                  return -1;
              }
              return 0;
  
          }
          return -1;
      }
  }
  
  class sortX implements Comparator<pair> {
      public int compare(pair p1, pair p2) {
          if (p1.xx > p2.xx) {
              return 1;
          } else if (p1.xx == p2.xx) {
              if (p1.yy > p2.yy) {
                  return 1;
              } else if (p1.yy < p2.yy) {
                  return -1;
              }
              return 0;
  
          }
          return -1;
      }
  }
  
  class debug {
  
      static void print1d(long[] arr) {
          System.out.println();
          for (int i = 0; i < arr.length; i++) {
              System.out.print(arr[i] + " ");
          }
  
      }
  
      static void print1d(int[] arr) {
          System.out.println();
          for (int i = 0; i < arr.length; i++) {
              System.out.println(i+" = "+arr[i]);
          }
  
      }
  
      static void print1d(boolean[] arr) {
          System.out.println();
          for (int i = 0; i < arr.length; i++) {
              System.out.println(i + "= " + arr[i]);
          }
  
      }
  
      static void print2d(int[][] arr) {
          System.out.println();
          int n = arr.length;
          int n2 = arr[0].length;
          for (int i = 0; i < n; i++) {
              for (int j = 0; j < n2; j++) {
                  System.out.print(arr[i][j] + " ");
              }
              System.out.println();
          }
  
      }
         static void print2d(boolean[][] arr) {
          System.out.println();
          int n = arr.length;
          int n2 = arr[0].length;
          for (int i = 0; i < n; i++) {
              for (int j = 0; j < n2; j++) {
                  System.out.print(arr[i][j] + " ");
              }
              System.out.println();
          }
  
      }
  
      static void print2d(long[][] arr) {
          System.out.println();
          int n = arr.length;
          int n2 = arr[0].length;
          for (int i = 0; i < n; i++) {
              for (int j = 0; j < n2; j++) {
                  System.out.print(arr[i][j] + " ");
              }
              System.out.println();
          }
  
      }
       static void printPair(ArrayList<pair> list) {
          if(list.size()==0){
              System.out.println("empty list");
              return;
          }
         System.out.println();
         for(int i=0;i<list.size();i++){
            System.out.println(list.get(i).xx+"-"+list.get(i).yy);
         }
      }
  
  }
  
  class Reader {
      final private int BUFFER_SIZE = 1 << 16;
      private DataInputStream din;
      private byte[] buffer;
      private int bufferPointer, bytesRead;
  
      public Reader() {
          din = new DataInputStream(System.in);
          buffer = new byte[BUFFER_SIZE];
          bufferPointer = bytesRead = 0;
      }
  
      public Reader(String file_name) throws IOException {
          din = new DataInputStream(new FileInputStream(file_name));
          buffer = new byte[BUFFER_SIZE];
          bufferPointer = bytesRead = 0;
      }
  
      public String readLine() throws IOException {
          byte[] buf = new byte[64]; // line length
          int cnt = 0, c;
          while ((c = read()) != -1) {
              if (c == '\n') {
                  if (cnt != 0) {
                      break;
                  } else {
                      continue;
                  }
              }
              buf[cnt++] = (byte) c;
          }
          return new String(buf, 0, cnt);
      }
  
      public int nextInt() throws IOException {
          int ret = 0;
          byte c = read();
          while (c <= ' ') {
              c = read();
          }
          boolean neg = (c == '-');
          if (neg)
              c = read();
          do {
              ret = ret * 10 + c - '0';
          } while ((c = read()) >= '0' && c <= '9');
  
          if (neg)
              return -ret;
          return ret;
      }
  
      public long nextLong() throws IOException {
          long ret = 0;
          byte c = read();
          while (c <= ' ')
              c = read();
          boolean neg = (c == '-');
          if (neg)
              c = read();
          do {
              ret = ret * 10 + c - '0';
          } while ((c = read()) >= '0' && c <= '9');
          if (neg)
              return -ret;
          return ret;
      }
  
      public double nextDouble() throws IOException {
          double ret = 0, div = 1;
          byte c = read();
          while (c <= ' ')
              c = read();
          boolean neg = (c == '-');
          if (neg)
              c = read();
  
          do {
              ret = ret * 10 + c - '0';
          } while ((c = read()) >= '0' && c <= '9');
  
          if (c == '.') {
              while ((c = read()) >= '0' && c <= '9') {
                  ret += (c - '0') / (div *= 10);
              }
          }
  
          if (neg)
              return -ret;
          return ret;
      }
  
      private void fillBuffer() throws IOException {
          bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
          if (bytesRead == -1)
              buffer[0] = -1;
      }
  
      private byte read() throws IOException {
          if (bufferPointer == bytesRead)
              fillBuffer();
          return buffer[bufferPointer++];
      }
  
      public void close() throws IOException {
          if (din == null)
              return;
          din.close();
      }
  }
   class MultiTreeSet<E> {
  	TreeMap<E, Integer> freqTreeMap = new TreeMap<E, Integer>();
  	int size;
   
  	public MultiTreeSet() {}
   
  	public MultiTreeSet(Collection<? extends E> c) {
  		for(E element : c)
  			add(element);
  	}
   
  	public int size() {
  		return size;
  	}
   
  	public void add(E element) {
  		Integer freq = freqTreeMap.get(element);
  		if(freq==null)
  			freqTreeMap.put(element, 1);
  		else
  			freqTreeMap.put(element,freq+1);
  		++size;
  	}
   
  	public void remove(E element) {
  		Integer freq = freqTreeMap.get(element);
  		if(freq!=null) {
  			if(freq==1)
  				freqTreeMap.remove(element);
  			else
  				freqTreeMap.put(element, freq-1);
  			--size;
  		}
  	}
   
  	public int get(E element) {
  		Integer freq = freqTreeMap.get(element);
  		if(freq==null)
  			return 0;
  		return freq;
  	}
   
  	public boolean contains(E element) {
  		return get(element)>0;
  	}
   
  	public boolean isEmpty() {
  		return size==0;
  	}
   
  	public E first() {
  		return freqTreeMap.firstKey();
  	}
   
  	public E last() {
  		return freqTreeMap.lastKey();
  	}
   
  	public E ceiling(E element) {
  		return freqTreeMap.ceilingKey(element);
  	}
   
  	public E floor(E element) {
  		return freqTreeMap.floorKey(element);
  	}
   
  	public E higher(E element) {
  		return freqTreeMap.higherKey(element);
  	}
   
  	public E lower(E element) {
  		return freqTreeMap.lowerKey(element);
  	}
  }
   