#include<bits/stdc++.h>
const int N=11e4;
using ll=long long;
using namespace std;
#define up(a,b,c) for(int a=b;a<=c;++a)
#define dn(a,b,c) for(int a=b;a>=c;--a)
int T,n,a[N],sm,ot;
bool ok;
vector<int>ccf;
int main()
{
	cin>>T;
	while(T--)
	{
		cin>>n;ok=0,sm=0,ot=0,ccf.clear();
		up(i,1,n)
		{
			cin>>a[i];
			if(sm>=600)ok=1;
			if(ok)
			{
				cout<<"0"<<endl;
				cout<<"IGNORE"<<endl;
				continue;
			}
			if(a[i]>=600)
			{
				ok=1;
				cout<<ccf.size();
				for(int x:ccf)
					cout<<' '<<x;
				cout<<endl;
				ccf.clear(),sm=a[i],ot=i;
				cout<<"TAKE"<<endl,ok=1;
			}
			else if(a[i]<=400)
			{
				if(sm+a[i]<=1000)
				{
					cout<<0<<endl;
					cout<<"TAKE"<<endl,sm+=a[i],ccf.push_back(i);
				}
				else
				{
					cout<<0<<endl;
					cout<<"IGNORE"<<endl,ok=1;
				}
			}
			else
			{
				if(sm+a[i]<=1000)
				{
					cout<<0<<endl;
					cout<<"TAKE"<<endl,sm+=a[i],ot=i;
				}
				else
				{
					if(!ccf.empty()&&a[ot]+a[i]<=1000)
					{
						vector<int>noi;
						int cc=0;sm+=a[i];
						while(sm>1000)
							++cc,noi.push_back(ccf.back()),sm-=a[ccf.back()],ccf.pop_back();
						cout<<cc;
						for(int z:noi)cout<<' '<<z;
						cout<<endl;
						cout<<"TAKE"<<endl,ot=i,ok=1;
					}
					else
					{
						if(a[i]<a[ot])
						{
							cout<<1<<' '<<ot<<endl,sm+=a[i]-a[ot],ot=i;
							cout<<"TAKE"<<endl;
						}
						else
						{
							cout<<0<<endl;
							cout<<"IGNORE"<<endl;
						}
					}
				}
			}
		}
	}
	return 0;
}