#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;

int query() {
    int ai;
    if (!(cin >> ai)) exit(0);
    return ai;
}

void solve() {
    int n;
    cin >> n;
    set<pii> a; int sum = 0;
    for (int i = 1; i <= n; i++) {
        int e = query();
        if (sum >= 600) {
            cout << "0\nIGNORE\n" << endl;
            continue;
        }
        if (e >= 600) {
            cout << a.size();
            for (auto [_, i]: a) cout << i << ' ';
            cout << endl;
            a.clear();
            a.emplace(e, i);
            sum = e;
            cout << "TAKE\n" << endl;
            continue;
        }
        if (e <= 401) {
            cout << "0\nTAKE\n" << endl;
            a.emplace(e, i);
            sum += e;
            continue;
        }
        if (e >= 500) {
            if (a.size() && a.begin()->first <= sum) {
                cout << "0\nIGNORE\n" << endl;
            } else if (a.size()) {
                cout << 1 << ' ' << a.begin()->second << endl;
                a.extract(a.begin());
                sum -= a.begin()->first;
                a.emplace(e, i);
                sum += e;
                cout << "TAKE\n" << endl;
            } else {
                cout << "0\nTAKE\n" << endl;
                a.emplace(e, i);
                sum += e;
            }
            continue;
        }
        vector<int> topop;
        while (sum + e > 1000) {
            auto [v, i] = *a.begin();
            a.extract(a.begin());
            topop.push_back(i);
            sum -= v;
        }
        cout << topop.size();
        for (auto i: topop) cout << ' ' << i;
        cout << endl;
        cout << "TAKE\n" << endl;
        a.emplace(e, i);
        sum += e;
    }
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);

    int t;
    cin >> t;
    for (; t; t--) solve();

    return 0;
}