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: //jai Shree Krishna
  import java.io.BufferedReader;
  import java.io.BufferedWriter;
  import java.io.IOException;
  import java.util.Collections;
  import java.io.InputStreamReader;
  import java.io.PrintWriter;
  import java.util.Comparator;
  import java.io.OutputStreamWriter;
  import java.util.ArrayList;
  import java.util.Arrays;
  import java.util.StringTokenizer;
  public class A{
  // author: Tarun Verma
  	static FastScanner sc = new FastScanner();
  	static int inf = Integer.MAX_VALUE;
  	static long mod = 1000000007;
  	static BufferedWriter output = new BufferedWriter(
  			new OutputStreamWriter(System.out));
  	static PrintWriter out=new PrintWriter(System.out);
  	/* Common Mistakes By Me
  	 * make sure to read the bottom part of question
  	 * special cases (n=1?)
  	 * in BIT MASKING try don't forget a^b=c == a^c=b
  	 * READ READ AND READ THE Test Cases VERY PROPERLY AND NEVER BE OVERCONFIDENT
  	 * Always Reset vis,adj array upto n+1 otherwise can cause TLE
  	 * Try to see array from back in increase and decrease questions
  	 */
  	public static void solve() {
  		int n = sc.nextInt();
  		pair a[] = new pair[n];
  		for(int i =0;i<n;i++) {
  			int u = sc.nextInt();
  			int v = sc.nextInt();
  			a[i] = new pair(u, v);
  		}
  		Arrays.sort(a, new Comparator<pair>() {
  			@Override
  			public int compare(pair o1, pair o2) {
  				if(o1.sc == o2.sc) {
  					return o1.fr - o2.fr;
  				} else {
  					return o1.sc - o2.sc;
  				}
  			}
  		});
  //		for(pair i: a) {
  //			System.out.println(i.fr + " " + i.sc);
  //		}
  //		System.out.println();
  //		int k = 1;
  		int vis[] = new int[n+1];
  		for(int i =0;i<n;i++) {
  			int min = a[i].fr;
  			
  			while(vis[min] == 1) {
  				min++;
  			}
  			vis[min] = 1;
  			System.out.println(a[i].fr + " " + a[i].sc + " " + min);
  		}
  			
  	}
  	public static void main(String[] args) {
  		int t = 1;
  		t = sc.nextInt();
  		outer: for (int tt = 0; tt < t; tt++) {
  			solve();
  		}
  	}
  	
  ////////////////////////////////////////////////////////////////////////////////////
  ////////////////////DO NOT BELOW THIS LINE //////////////////////////////////
  ////////////////////////////////////////////////////////////////////////////////////
  	static Comparator<pair> comp = new Comparator<pair>() {
  		@Override
  		public int compare(pair o1, pair o2) {
  			if(o1.fr == o2.fr) {
  				return o1.sc - o2.sc;
  			}
  			return o1.fr - o2.fr;
  		}
  	};
  	static int max(int a, int b) { return Math.max(a, b);} 
  	static int min(int a, int b) {return Math.min(a, b);}
  	static long max(long a, long b){return Math.max(a, b);}
  	static long min(long a, long b) {return Math.min(a, b);}
  	static void sort(int arr[]) {
  		ArrayList<Integer> a = new ArrayList<Integer>();
  		for(int i: arr) a.add(i);
  		Collections.sort(a);
  		for(int i=0;i<arr.length;i++) arr[i] = a.get(i);
  	}
  	static void sort(long arr[]) {
  		ArrayList<Long> a = new ArrayList<Long>();
  		for(long i: arr) a.add(i);
  		Collections.sort(a);
  		for(int i=0;i<arr.length;i++) arr[i] = a.get(i);
  	}
  	static int abs(int a) {return Math.abs(a);}
  	static long abs(long a) {return Math.abs(a);}
  	static int gcd(int a, int b) {
  		if (b == 0)
  			return a;
  		return gcd(b, a % b);
  	}
  	static long gcd(long a, long b) {
  		if (b == 0)
  			return a;
  		return gcd(b, a % b);
  	}
  	
  	static class FastScanner {
  		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  		StringTokenizer st = new StringTokenizer("");
  		
  		String next() {
  			while (!st.hasMoreTokens())
  				try {
  					st = new StringTokenizer(br.readLine());
  				} catch (IOException e) {
  					e.printStackTrace();
  				}
  			return st.nextToken();
  		}
  		int nextInt() {
  			return Integer.parseInt(next());
  		}
  		int[] readArray(int n) {
  			int[] a = new int[n];
  			for (int i = 0; i < n; i++)
  				a[i] = nextInt();
  			return a;
  		}
  		long[] readLongArray(int n) {
  			long[] a = new long[n];
  			for (int i = 0; i < n; i++)
  				a[i] = nextLong();
  			return a;
  		}
  		
  		int[][] read2dArray(int n, int m) {
  			int arr[][] = new int[n][m];
  			for (int i = 0; i < n; i++) {
  				for (int j = 0; j < m; j++) {
  					arr[i][j] = nextInt();
  				}
  			}
  			return arr;
  		}
  		
  		ArrayList<Integer> readArrayList(int n) {
  			ArrayList<Integer> arr = new ArrayList<Integer>();
  			for (int i = 0; i < n; i++) {
  				int a = nextInt();
  				arr.add(a);
  			}
  			return arr;
  		}
  		
  		long nextLong() {
  			return Long.parseLong(next());
  		}
  	}
  	
  	static class pair {
  		int fr, sc;
  		
  		pair(int fr, int sc) {
  			this.fr = fr;
  			this.sc = sc;
  		}
  	}
  	
  ////////////////////////////////////////////////////////////////////////////////////	
  	
  }
  