#pragma GCC optimize(3,"Ofast","inline")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=300005;
const ll mod=998244353;
ll qpow(ll a,ll b){
	ll ans=1;
	if(b==0)
	return 1;
	if(b%2)
	ans=a;
	ll t=qpow(a,b/2);
	return t*t%mod*ans%mod;
}
ll inv(ll a){
	return qpow(a,mod-2);
}
vector<pair<int,int>>v1,v2,v3;
void op(vector<int>v){
	cout<<v.size()<<' ';
	for(int i=0;i<v.size();i++){
		cout<<v[i]<<' ';
	}
	cout<<"\n";
	cout.flush();
}
void take(int x){
	if(x==1)
	cout<<"TAKE\n";
	else
	cout<<"IGNORE\n";
	
	cout.flush();
	
}
void solve(){
	ll n;
	cin>>n;
	ll sum=0;
	v1.clear(),v2.clear(),v3.clear();
	for(int t=1;t<=n;t++){
		ll x;
		cin>>x;
		vector<int>v;
		pair<int,int>cur={t,x};
		if(sum>=600){
			op(v);
			take(0);
		}
		else if(x>=600){
			while(v1.size()){
				sum-=v1[v1.size()-1].second;
				v.push_back(v1[v1.size()-1].first);
				v1.pop_back();
			}
			while(v2.size()){
				sum-=v2[v2.size()-1].second;
				v.push_back(v2[v2.size()-1].first);
				v2.pop_back();
			}
			v3.push_back(cur);
			sum+=x;
			op(v);
			take(1);
		}
		else if(x>=400){
			if(v2.size()==1){
				if(v2[0].second+x<=1000){
					while(v1.size()){
						sum-=v1[v1.size()-1].second;
						v.push_back(v1[v1.size()-1].first);
						v1.pop_back();
					}
					op(v);
					take(1);
				}
				else if(v2[0].second<=x){
					op(v);
					take(0);
					//continue;
				}
				else{
					sum-=v2[0].second;
					v.push_back(v2[0].first);
					v2.pop_back();
					
					v2.push_back(cur);
					sum+=x;
					op(v);
					take(1);
				}
			}
			else{
				v2.push_back(cur);
				sum+=x;
				while(sum>=1000){
					assert(v1.size());
					sum-=v1[v1.size()-1].second;
					v.push_back(v1[v1.size()-1].first);
					v1.pop_back();
				}
				op(v);
				take(1);
			}
		}
		
		else{
			v1.push_back(cur);
			sum+=x;
			op(v);
			take(1);
		}
	}
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	int t0;
	cin>>t0;
	for(int t=0;t<t0;t++){
		solve();
	}
}