#include <bits/stdc++.h>
using namespace std;
int n,m;
int a[1000010];
multiset<int>st;
priority_queue<int,vector<int>,greater<int> >q;
int main()
{
    freopen("logistics.in","r",stdin);
    freopen("logistics.out","w",stdout); 
    cin>>n>>m;
    for(int i=1;i<=n;i++) st.insert(0);
    while(m--)
    {
        char op;
        int x,y;
        cin>>op>>x>>y;
        if(op=='U')
        {
            auto it=st.lower_bound(a[x]);
            st.erase(it);
            a[x]=y;
            st.insert(y);
        }
        else
        {
            while(q.size()) q.pop();
            for(int i=1;i<=x;i++) q.push(y);
            for(auto it=st.rbegin();it!=st.rend()&&q.size();it++)
            {
                int tmp=*it,top=q.top();
                if(!tmp) break;
                q.pop();
                if(top>tmp) q.push(top-tmp);
            }
            if(q.empty()) cout<<"TAK\n";
            else cout<<"NIE\n";
        }
    }
    return 0;              
}