#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned ll;using pii=pair<int,int>;
const int N=1e6+5,M=N*100+5,K=1e7+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const ll INF=5e18+7;mt19937 rnd(time(0));
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,A[N];
int st[N],sh,sum;
void Solve(){
	cin>>n;sh=0;sum=0;
	for(int i=1;i<=n;cout.flush(),i++){
		cin>>A[i];
		if(sum>=600){
			cout<<0<<'\n';
			cout<<"IGNORE"<<endl;
			continue;
		}
		if(A[i]<=400){
			cout<<0<<endl;
			cout<<"TAKE"<<endl;
			st[++sh]=i;sum+=A[i];
			continue;
		}
		if(A[i]>=600){
			cout<<sh<<' ';
			for(int j=1;j<=sh;j++) cout<<st[j]<<' ';
			cout<<endl;
			cout<<"TAKE"<<endl;
			st[sh=1]=i;sum=A[i];
			continue;
		}
		if(sum+A[i]<=1000){
			cout<<0<<'\n';
			cout<<"TAKE"<<endl;
			st[++sh]=i;sum+=A[i];
			continue;
		}
		int mx=0;for(int j=1;j<=sh;j++) if(A[st[j]]>=400) mx=st[j];
		if(mx){
			if(A[mx]+A[i]<=1000){
				cout<<sh-1<<'\n';
				for(int j=1;j<=sh;j++) if(st[j]^mx) cout<<st[j]<<' ';cout<<'\n';
				cout<<"TAKE"<<endl;
				st[sh=1]=mx;st[sh=2]=i;sum=A[mx]+A[i];
				continue;
			}
			if(A[mx]>A[i]){
				cout<<1<<' '<<mx<<'\n';
				cout<<"TAKE"<<endl;
				sum-=A[mx];
				for(int j=1;j<=sh;j++) if(st[j]==mx){
					st[j]=i;
					break;
				}
				sum+=A[i];
			}else{
				cout<<"0\n";
				cout<<"IGNORE"<<endl;
			}
		}else{
			st[++sh]=i;sum+=A[i];
			vector<int> es;
			while(sum>1000){
				int mi=st[1];
				for(int j=2;j<=sh;j++) if(A[st[j]]<A[mi]) mi=st[j];
				es.push_back(mi);
				for(int j=1;j<=sh;j++) if(st[j]==mi){
					rotate(st+j,st+j+1,st+sh+1),sh--;
					break;
				}
				sum-=A[mi];
			}
			cout<<es.size()<<' ';
			for(int j:es) cout<<j<<' ';cout<<'\n';
			cout<<"TAKE"<<endl;
		}
	}
}
int main(){
	// freopen("1.in","r",stdin);freopen("1.out","w",stdout);
	int t=1;
	scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}