// horizon
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <cmath>

using namespace std;

#define EQUAL(a, b) (abs(a-b) < 1e-10)

typedef pair<int, int> point;
#define XX first
#define YY second
point pt[60];
bool used[60];
int N;

double len(point a, point b){
  return ((a.XX - b.XX)*(a.XX - b.XX) + (a.YY-b.YY)*(a.YY-b.YY));
}

void solve(point p, double th){
  double minarg = 1.0e10;
  int minpos;
  double arg;
  for(int i=0; i<N; i++){
    if(!used[i]){
      arg = atan((double)(pt[i].YY - p.YY) / (double)(pt[i].XX - p.XX));
      while(arg < th){ arg += 2 * M_PI; }
      // cout << "#" << arg << endl;
      if(EQUAL(arg, minarg)){
	if(len(p, pt[i]) < len(p, pt[minpos])){
	  minarg = arg;
	  minpos = i;
	}
      }else if(arg < minarg){
	minarg = arg;
	minpos = i;
      }
    }
  }
  if(minarg == 1.0e10){
    return;
  }
  used[minpos] = true;
  
  cout << " " << (minpos+1);
  solve(pt[minpos], minarg);
}

int main()
{
  ifstream cin("ant.txt");
  int M;
  cin >> M;
  for(int i=0; i<M; i++){
    cin >> N;
    int a, b, c;
    int miny = 1000;
    for(int j=0; j<N; j++){
      cin >> a >> b >> c;
      pt[a-1].XX = b;
      pt[a-1].YY = c;
      used[a-1] = false;
      if(c < miny){ miny = c; }
    }
    cout << N;
    solve(make_pair(0, miny), 0.0);
    cout << endl;
  }
}