#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<utility>
#include<vector>
#include<functional>
#include<deque>
#include<set>
#include<cmath>
using namespace std;
typedef pair<long long, long long> pii;
typedef vector<long long> vll;
typedef long long ll;
typedef long long i64;

//#define DEBUG

#ifdef DEBUG
const long long N = 1000;
#endif
#ifndef DEBUG
const long long N = 10100;
#endif
// const ll M = 998244353;
inline ll read()
{
	ll tmp;
	if(!(cin >> tmp))
		exit(0);
	return tmp;
}
inline void clr()
{
	fflush(stdout);
}
ll n, a[N];
set<pii> table;
int main()
{
    #ifdef DEBUG
    freopen("1.txt", "r", stdin);
    #endif
//    #ifndef DEBUG
//    ios::sync_with_stdio(false);
//    cin.tie(nullptr);
//    cout.tie(nullptr);
//    #endif
    int z;
    //z = 1;
    cin >> z;
    while(z--){
		n = read();
		table.clear();
		ll s = 0;
		bool win = 0;
		for(ll i=1; i<=n; i++)
		{
			cerr << s << '\n';
			a[i] = read();
			if(win || a[i] == 0)
			{
				cerr << "Win0\n";
				cout << "0\nIGNORE\n";
				clr();
				continue;
			}
			
			if(a[i] >= 600)
			{
				win = 1;
				cout << table.size() << ' ';
				for(pii j: table) cout << j.second << ' ';
				cout << '\n';
				cerr << "Singular600\n";
				cout << "TAKE\n";
				clr();
				continue;
			}
			
			if(s + a[i] <= 1000)
			{
				s += a[i];
				table.insert({a[i], i});
				cerr << "GreedyTake\n";
				cout << "0\nTAKE\n";
				if(s >= 600) win = 1;
				clr();
				continue;
			}
			
			// Now: a[i] \in [402,599], s < 600
			
			auto mx = table.end(); mx--;
			if(mx->first + a[i] >= 600 && mx->first + a[i] <= 1000)
			{
				win = 1;
				cout << table.size() - 1 << ' ';
				for(auto i = table.begin(); i != mx; i++)
					cout << i->second << ' ';
				
				cout << "\nTAKE\n";
				cerr << "Pair600_max1\n";
				clr();
				continue;
			}
			if(mx != table.begin())
			{
				mx--;
				if(mx->first + a[i] >= 600 && mx->first + a[i] <= 1000)
				{
					win = 1;
					cout << table.size() - 1 << ' ';
					for(auto i = table.begin(); i != mx; i++)
						cout << i->second << ' ';
					mx++;
					cout << mx->second << '\n';
					cerr << "Pair600_max2\n";
					cout << "TAKE\n";
					clr();
					continue;
				}
				mx++;
			}
			// Now: a[i] \in [402,599], s < 600,
			// max + a[i] > 1k, second largest + a[i] < 600, 
			// max >= 402, second largest <= 197
			if(mx->first > a[i])
			{
				cerr << "MaxReplace\n";
				cout << "1 " << mx->second << "\nTAKE\n";
				s -= mx->first;
				s += a[i];
				table.erase(mx);
				table.insert({a[i], i});
			}
			else cout << "0\nIGNORE\n";
			clr();
		}
    }
 	return 0;
}
/*BEFORE SUBMISSION:
1. remove #define DEBUG
2. check data constraints
3. check memory reset for multitest
4. check integer overflow
5. parenthesize all bitwise operations
6. run all sample tests in random order
*/