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

using ll = long long;
using ld = long double;

#define all(a) begin(a), end(a)
#define len(a) int((a).size())

void solve(int /* test_num */) {
    int n;
    cin >> n;

    vector<pair<int, int>> a;
    bool got = false;

    for (int id = 1; id <= n; id++) {
        int val;
        cin >> val;
        if (got) {
            cout << "0\nIGNORE" << endl;
            continue;
        }

        a.emplace_back(val, id);
        constexpr int N = 1000;
        vector<int> ways(N + 1);
        ways[0] = 1;

        auto update = [&](int x) {
            for (int i = N; i >= x; i--) {
                ways[i] += ways[i - x];
            }
        };

        auto roll_back = [&](int x) {
            for (int i = x; i <= N; i++) {
                ways[i] -= ways[i - x];
            }
        };

        for (auto [x, id] : a) {
            update(x);
        }

        int w = N;
        while (ways[w] == 0) {
            w--;
        }
        if (w >= 600) {
            got = true;

            vector<int> rem;
            vector<pair<int, int>> b;
            for (auto [x, i] : a) {
                if (x <= w) {
                    roll_back(x);
                    if (ways[w - x] > 0) {
                        w -= x;
                        b.emplace_back(x, i);
                    } else {
                        update(x);
                        rem.push_back(i);
                    }
                }
            }
            a = b;

            cout << len(rem);
            for (auto i : rem) {
                cout << ' ' << i;
            }
            cout << "\nTAKE" << endl;
            continue;
        }

        vector<pair<int, int>> big;
        for (auto [x, i] : a) {
            if (x >= 400) {
                big.emplace_back(x, i);
            }
        }

        sort(all(big));
        assert(len(big) <= 2);

        if (len(big) == 2) {
            assert(big[0].second == id || big[1].second == id);
            if (big[1].second == id) {
                cout << "0\nIGNORE" << endl;
            } else {
                cout << "1 " << big[1].second << "\nTAKE" << endl;
            }
        } else {
            int sum = 0;
            for (auto [x, i] : a) {
                sum += x;
            }
            assert(sum <= N);
            cout << "0\nTAKE" << endl;
        }
    }
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    int tests;
    cin >> tests;
    for (int test_num = 1; test_num <= tests; test_num++) {
        solve(test_num);
    }
}