#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int N = 1e5 + 3;
int T;
int n, num;


void work(){
	cin >> n;
	int p = 0; vector<int> cake(n+1);
	vector<int> have; int s = 0, big = 0, idd = 0;
	for(int i = 1; i <= n; ++i){
		cin >> cake[i];
		if(p){
			cout << "0\nIGNORE\n" << flush;
			continue;
		}
		if(cake[i] >= 600){
			cout << have.size() << " ";
			for(auto x : have) cout << x << " ";
			cout << "\nTAKE\n" << flush; 
			p = 1;
		}else if(cake[i] <= 400){
			cout << "0\nTAKE\n" << flush;
			s += cake[i];
			have.push_back(i);
		}else{
			if(!big){
				big = cake[i], s += cake[i], idd = i;
				vector<int> erasse;
				while(s > 1000){
					s -= cake[have.back()];
					erasse.push_back(have.back());
					have.pop_back();
				}
				cout << erasse.size();
				for(auto x : erasse) cout << " " << x;
				cout << "\nTAKE\n" << flush;
				
			}else if(cake[i] < big){
				cout << "1 " << idd << "\nTAKE\n" << flush;
				s = s - big + cake[i], idd = i;
				big = cake[i];
			}else{
				cout << "0\nIGNORE\n" << flush;
			}
		}	
		if(s >= 600)	p = 1;		
	}
}


int main(){
//	freopen("test.txt", "r", stdin);
//	ios::sync_with_stdio(false);
//	cin.tie(0);
	int T = 1;
	cin >> T;
	while(T--){
		work();
	}
	return 0;
}