1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
const ll mod=1000000007;
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=5010,M=1200000;
int l[N],r[N],del[N],tot,x[N],y[N],id[N],n,seg[N],_;
ll yh[N],h[N],len[N];
pair<PII,int> p[N];
ll tmp[N];
int fst[M],mark[M],nxt[N],P,T;

void init(int n) {
	rep(i,0,n) tmp[i]=x[i]*mod+y[i];
	while (1) {
		P=1000000+rand()%100000;
		int ret=0;
		map<int,int> cnt;
		rep(i,0,n) {
			ll key=tmp[i]%P;
			ret+=cnt[key]++;
		}
		if (ret<100) break;
	}
	++T;
	rep(i,0,n) {
		int key=tmp[i]%P;
		if (mark[key]!=T) mark[key]=T,fst[key]=-1;
		nxt[i]=fst[key]; fst[key]=i;
	}
}
int query(int x,int y) {
	ll val=x*mod+y;
	int key=val%P;
	if (mark[key]!=T) return -1;
	for (int j=fst[key];j!=-1;j=nxt[j]) if (tmp[j]==val) return j;
	return -1;
}
int gao(int n,int ub) {
	h[0]=(1ll<<60); h[1]=0; h[2]=(1ll<<60);
	yh[0]=-1; yh[1]=0; yh[2]=ub;
	r[0]=1; r[1]=2; l[1]=0; l[2]=1;
	tot=3;
	del[0]=del[1]=del[2]=0;
	rep(i,0,n) seg[i]=-1;
	seg[0]=1;
	rep(i,0,n) {
		if (seg[i]==-1) return -1;
		int u=seg[i],v=r[u];
		if (h[u]!=x[i]||yh[u]!=y[i]||del[u]) return -1;
		if (i!=n-1&&x[i+1]==x[i]&&y[i+1]<yh[v]) {
			int w=tot++;
			del[w]=0;
			l[w]=u; r[w]=v; r[u]=w; l[v]=w;
			h[w]=h[u]; yh[w]=y[i+1];
			seg[i+1]=w;
			len[id[i]]=y[i+1]-y[i];
			h[u]+=len[id[i]];
		} else {
			len[id[i]]=yh[v]-yh[u];
			h[u]+=len[id[i]];
		}
		v=r[u];
		if (h[u]==h[v]) {
			r[u]=r[v];
			l[r[v]]=u;
			del[v]=1;
		}
		v=l[u];
		if (h[v]==h[u]) {
			l[u]=l[v];
			r[l[u]]=u;
			del[v]=1;
			yh[u]=yh[v];
		}
		int w=query(h[u],yh[u]);
		if (w!=-1) seg[w]=u;
	}
	if (r[r[0]]==2) return h[r[0]];
	return -1;
}
bool solve() {
	if (n==1) {
		len[0]=1;
		return 1;
	}
	sort(p,p+n);
	rep(i,1,n) if (p[i].fi==p[i-1].fi) return 0;
	rep(i,0,n) x[i]=p[i].fi.fi,y[i]=p[i].fi.se,id[i]=p[i].se;
	if (x[0]!=0||y[0]!=0) return 0;
	init(n);
	int pid=0;
	rep(i,0,n) if (x[i]==0&&y[i]>y[pid]) pid=i;
	rep(i,0,n) {
		int w=gao(n,y[pid]+x[i]);
		if (w!=-1) return 1;
	}
	rep(j,pid,n-1) swap(x[j],x[j+1]),swap(y[j],y[j+1]),swap(id[j],id[j+1]);
	init(n-1);
	int w=gao(n-1,y[n-1]);
	if (w!=-1) {
		len[id[n-1]]=w;
		return 1;
	}
	return 0;
}
int main() {
	for (scanf("%d",&_);_;_--) {
		scanf("%d",&n);
		int mx=1e9,my=1e9;
		rep(i,0,n) {
			scanf("%d%d",&p[i].fi.fi,&p[i].fi.se);
			mx=min(mx,p[i].fi.fi);
			my=min(my,p[i].fi.se);
			p[i].se=i;
		}
		rep(i,0,n) p[i].fi.fi-=mx,p[i].fi.se-=my;
		if (!solve()) {
			puts("NIE");
		} else {
			printf("TAK");
			rep(i,0,n) printf(" %lld",len[i]);
			puts("");
		}
	}
}