#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int n,m;
char opt;
int x,y;
int a[1000005];
int b[1000005];
bool cmp(int x,int y){
    return x>y;
}
int main(){
    freopen("logistics.in","r",stdin);
    freopen("logistics.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(;m--;){
        cin>>opt;
        scanf("%d%d",&x,&y);
        if(opt=='U'){
            a[x]=y;
        }else{
            long long ans=0;
            for(int i=1;i<=n;i++){
                if(a[i]>=y) ans+=y;
                else    ans+=a[i];
            }
            if(ans>=(long long)(x*y)){
                printf("TAK\n");
            }else{
                printf("NIE\n");
            }
        }
    }
    return 0;
}