#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define N 1000005
#define int long long
#define ul unsigned long long
#define db double
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int n,m,a[N],b[N],cnt,ans,x,y,z;
int t1[N],t2[N];//和，个数
char op[2];
struct node{bool op;int x,y;}q[N];
void swap(int &x,int &y){int t=x;x=y;y=t;}
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
void ud1(int x,int k){if(!x)return;while(x<=m)t1[x]+=k,x+=x&-x;}
void ud2(int x,int k){if(!x)return;while(x<=m)t2[x]+=k,x+=x&-x;}
int gs1(int x){int sum=0;while(x)sum+=t1[x],x&=x-1;return sum;}
int gs2(int x){int sum=0;while(x)sum+=t2[x],x&=x-1;return sum;}
int read(){
	int sum=0;bool f=0;char c=getchar();
	for(;c<48||c>57;c=getchar())if(c==45)f=1;
	for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
	return f?-sum:sum;
}
signed main(){ 
	freopen("logistics.in","r",stdin);freopen("logistics.out","w",stdout);
	n=read();m=read();
	ud2(1,n);
	fo(i,1,m)
	{
		scanf("%s",op);x=read();y=read();
		b[i]=y;
		q[i]={op[0]=='Z',x,y};
	}
	b[m+1]=0;
	sort(b+1,b+m+2);
	cnt=unique(b+1,b+m+2)-b-1;
	fo(i,1,m)
	{
		x=q[i].x,y=q[i].y,z=lower_bound(b+1,b+cnt+1,y)-b;
		if(!q[i].op)
		{
			int hs=lower_bound(b+1,b+cnt+1,a[x])-b;
			ud1(hs,-a[x]);
			ud2(hs,-1);
			a[x]=y;
			ud1(z,y);
			ud2(z,1);
		}
		else
		{
			x-=n-gs2(z);
			if(x<=0){printf("TAK\n");continue;}
			if(x*y<=gs1(z))printf("TAK\n");
			else printf("NIE\n");
		}
	}
	return 0;
}