#include "bits/stdc++.h"
using namespace std;

#define ll long long 
#define INF 0x3f3f3f3f
#define LNF 0x3f3f3f3f3f3f3f3fll
#define MOD 998244353

#define N 5050

int main() {
#ifdef TEST
    freopen("zz.in", "r+", stdin);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t; cin >> t;
    while (t --) {
        int n; cin >> n;

        vector<vector<pair<int, int>>> bk(3);
        vector<int> bksum(3, 0);
        int tot = 0;

        auto sum = [&]() {
            return accumulate(bksum.begin(), bksum.end(), 0);
        };

        auto add = [&](int bkid, int i, int a) {
            bk[bkid].emplace_back(i, a);
            bksum[bkid] += a;
        };

        auto pop_back = [&](int bkid, vector<int>& cont) {
            cont.emplace_back(bk[bkid].back().first);
            int val = bk[bkid].back().second;
            bksum[bkid] -= val;
            return val;
        };

        auto pop_clear = [&](int bkid, vector<int>& cont) {
            for (auto [idx, x] : bk[bkid]) cont.emplace_back(idx);
            bk[bkid].clear();
            bksum[bkid] = 0;
        };

        auto print = [&](bool take, vector<int>& cont) {
            cout << cont.size() << ' ';
            for (auto x : cont) cout << x << ' ';
            cout << (take ? "\nTAKE\n" : "\nIGNORE\n");
        };

        for (int i = 1; i <= n; ++ i) {
            int a; cin >> a;

            if (sum() >= 600) {
                cout << "0\nIGNORE\n";
                cout.flush();
                continue;
            }

            vector<int> rm;

            // 0-299 300-599 600-1000 
            if (a < 300) {
                add(0, i, a);
                print(1, rm);
            } else if (a < 600) {
                if (bk[1].size() == 0) {
                    add(1, i, a);
                    while (sum() > 1000) pop_back(0, rm);
                    print(1, rm);
                } else if (bk[1].size() == 1) {
                    if (bksum[1] + a <= 1000) {
                        pop_clear(0, rm);
                        add(1, i, a);
                        print(1, rm);
                    } else {
                        if (bk[1][0].second > a) {
                            print(0, rm);
                        } else {
                            pop_clear(1, rm);
                            add(1, i, a);
                            print(1, rm);
                        }
                    }
                } else {
                    assert(0);
                }
            } else {
                pop_clear(0, rm);
                pop_clear(1, rm);
                add(2, i, a);
                print(1, rm);
            }

            cout.flush();
        }
        
    }
}