#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
#include<cstring>
#include<set>
using namespace std;

int t, n;
vector<pair<int, int>> S, M; //<val, id>
multiset<pair<int, int>> L;


int main() {
    int t;
    scanf("%d", &t);
    while (t--) {
        scanf("%d", &n);
        S.clear(); M.clear(); L.clear();

        int sum = 0;
        for (int i = 1;i <= n;i++) {
            int cur;
            scanf("%d", &cur);

            if (sum >= 600 && sum <= 1000) {
                printf("0\nIGNORE\n");
                fflush(stdout);
                continue;
            }

            if (sum + cur >= 600 && sum + cur <= 1000) {
                sum += cur;

                printf("0\nTAKE\n");
                fflush(stdout);
                continue;
            }

            if (cur >= 600) {
                printf("%d ", S.size() + M.size() + L.size());
                for (auto p : S) printf("%d ", p.second);
                for (auto p : M) printf("%d ", p.second);
                for (auto p : L) printf("%d ", p.second);
                sum = cur;

                printf("\nTAKE\n");
                fflush(stdout);
                continue;
            }

            if (M.size() && cur >= 400) {
                vector<int> outp;
                for (auto p : S) outp.push_back(p.second);
                for (auto p : M) if (p.second != M[0].second) outp.push_back(p.second);
                sum = M[0].first + cur;

                printf("%d ", outp.size());
                for (auto p : outp) printf("%d ", p);
                printf("\nTAKE\n");
                fflush(stdout);
                continue;
            }

            if (L.size() && cur >= 200 && cur < 400) {
                vector<int> outp;
                for (auto p : S) outp.push_back(p.second);
                for (auto p : L) if (p.first != L.rbegin()->second) outp.push_back(p.second);
                sum = L.rbegin()->first + cur;

                printf("%d ", outp.size());
                for (auto p : outp) printf("%d ", p);
                printf("\nTAKE\n");
                fflush(stdout);
                continue;
            }

            if (cur < 200) {
                S.push_back({ cur, i });
                sum += cur;

                printf("0\nTAKE\n");
                fflush(stdout);
                continue;
            }

            if (cur >= 200 && cur < 400) {
                M.push_back({ cur, i });
                sum += cur;

                printf("0\nTAKE\n");
                fflush(stdout);
                continue;
            }

            if (cur >= 400 && cur < 600) {
                if (L.size() && L.rbegin()->first >= cur) {
                    printf("0\nIGNORE\n");
                    fflush(stdout);
                    continue;
                }

                vector<int> outp;

                if (!L.size()) {
                    L.insert({ cur, i });
                    sum += cur;
                }
                else {
                    sum += cur - L.rbegin()->first;

                    auto It = L.end(); It--;
                    outp.push_back(It->second);
                    L.erase(It);
                    L.insert({ cur, i });
                }

                while (sum > 1000) {
                    sum -= S.back().first;
                    outp.push_back(S.back().second);
                    S.pop_back();
                }

                printf("%d ", outp.size());
                for (auto p : outp) printf("%d ", p);
                printf("\nTAKE\n");
                fflush(stdout);
                continue;
            }
        }
    }
}