#include<bits/stdc++.h>
using namespace std;
int n;
const int N=1000;
const int M=600;
#define ll long long
const int mod=1e9+7;
int f[N+5];
priority_queue<pair<int,int> > pq;
int sum;
void ins(int x,int y)
{
    pq.push({x,y});
    for (int i=sum;i>=0;--i)
        (f[i+x]+=f[i])%=mod;
    sum+=x;
}
void del()
{
    auto [x,y]=pq.top();
    pq.pop();
    sum-=x;
    for (int i=0;i<=sum;++i)
        (f[i+x]+=(mod-f[i])%mod)%=mod;
}
bitset<N> g[N];
void work(int x)
{
    vector<pair<int,int>> v;
    set<int> s;
    g[0].reset();
    g[0][0]=1;
    for (int i=1;!pq.empty();++i)
    {
        auto [x,y]=pq.top();
        pq.pop();
        s.insert(y);
        v.emplace_back(x,y);
        g[i]=g[i-1]|(g[i-1]<<x);
    }
    int sum=x;
    for (int i=(int)v.size()-1;i>=0;--i)
        if (sum>=v[i].first&&g[i][sum-v[i].first])
        {
            s.erase(v[i].second);
            sum-=v[i].first;
        }
    printf("%d",(int)s.size());
    for (int x:s)
        printf(" %d",x);
    puts("");
}
void solve()
{
    fflush(stdout);
    scanf("%d",&n);
    for (int i=0;i<=N;++i)
        f[i]=0;
    f[0]=1;
    sum=0;
    for (int i=1,x;i<=n;++i)
    {
        fflush(stdout);
        scanf("%d",&x);
        if (sum>=M)
        {
            puts("0");
            puts("IGNORE");
            continue;
        }
        if (x+sum<=N)
        {
            ins(x,i);
            puts("0");
            puts("TAKE");
            continue;
        }
        bool b=false;
        for (int j=0;j<=1000-x;++j)
            if (j+x>=600&&f[j])
            {
                work(j);
                puts("TAKE");
                b=true;
                sum=j+x;
                break;
            }
        if (b)
            continue;
        if (pq.top().first<=x)
        {
            puts("0");
            puts("IGNORE");
            continue;
        }
        printf("1 %d\n",pq.top().second);
        puts("TAKE");
        del();
        ins(x,i);
    }
    fflush(stdout);
    while (!pq.empty())
        pq.pop();
}
int main()
{
    int t;
    scanf("%d",&t);
    while (t--)
        solve();
    return 0;
}