#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())

/*
 ! WARNING: MOD must be prime.
 ! WARNING: MOD must be less than 2^30.
 * Use .get() to get the stored value.
 */
template<uint32_t mod>
class montgomery {
    static_assert(mod < uint32_t(1) << 30, "mod < 2^30");
    using mint = montgomery<mod>;

private:
    uint32_t value;

    static constexpr uint32_t inv_neg_mod = []() {
        uint32_t x = mod;
        for (int i = 0; i < 4; ++i) {
            x *= uint32_t(2) - mod * x;
        }
        return -x;
    }();
    static_assert(mod * inv_neg_mod == -1);

    static constexpr uint32_t neg_mod = (-uint64_t(mod)) % mod;

    static uint32_t reduce(const uint64_t &value) {
        return (value + uint64_t(uint32_t(value) * inv_neg_mod) * mod) >> 32;
    }

    inline static const mint ONE = mint(1);

public:
    montgomery() : value(0) {}
    montgomery(const mint &x) : value(x.value) {}

    template<typename T, typename U = std::enable_if_t<std::is_integral<T>::value>>
    montgomery(const T &x) : value(!x ? 0 : reduce(int64_t(x % int32_t(mod) + int32_t(mod)) * neg_mod)) {}

    static constexpr uint32_t get_mod() {
        return mod;
    }

    uint32_t get() const {
        auto real_value = reduce(value);
        return real_value < mod ? real_value : real_value - mod;
    }

    template<typename T>
    mint power(T degree) const {
        degree = (degree % int32_t(mod - 1) + int32_t(mod - 1)) % int32_t(mod - 1);
        mint prod = 1, a = *this;
        for (; degree > 0; degree >>= 1, a *= a)
            if (degree & 1)
                prod *= a;

        return prod;
    }

    mint inv() const {
        return power(-1);
    }

    mint& operator=(const mint &x) {
        value = x.value;
        return *this;
    }

    mint& operator+=(const mint &x) {
        if (int32_t(value += x.value - (mod << 1)) < 0) {
            value += mod << 1;
        }
        return *this;
    }

    mint& operator-=(const mint &x) {
        if (int32_t(value -= x.value) < 0) {
            value += mod << 1;
        }
        return *this;
    }

    mint& operator*=(const mint &x) {
        value = reduce(uint64_t(value) * x.value);
        return *this;
    }

    mint& operator/=(const mint &x) {
        return *this *= x.inv();
    }

    friend mint operator+(const mint &x, const mint &y) {
        return mint(x) += y;
    }

    friend mint operator-(const mint &x, const mint &y) {
        return mint(x) -= y;
    }

    friend mint operator*(const mint &x, const mint &y) {
        return mint(x) *= y;
    }

    friend mint operator/(const mint &x, const mint &y) {
        return mint(x) /= y;
    }

    mint& operator++() {
        return *this += ONE;
    }

    mint& operator--() {
        return *this -= ONE;
    }

    mint operator++(int) {
        mint prev = *this;
        *this += ONE;
        return prev;
    }

    mint operator--(int) {
        mint prev = *this;
        *this -= ONE;
        return prev;
    }

    mint operator-() const {
        return mint(0) - *this;
    }

    bool operator==(const mint &x) const {
        return get() == x.get();
    }

    bool operator!=(const mint &x) const {
        return get() != x.get();
    }

    bool operator<(const mint &x) const {
        return get() < x.get();
    }

    template<typename T>
    explicit operator T() {
        return get();
    }

    friend std::istream& operator>>(std::istream &in, mint &x) {
        std::string s;
        in >> s;
        x = 0;
        bool neg = s[0] == '-';
        for (const auto c : s)
            if (c != '-')
                x = x * 10 + (c - '0');

        if (neg)
            x *= -1;

        return in;
    }

    friend std::ostream& operator<<(std::ostream &out, const mint &x) {
        return out << x.get();
    }

    static int32_t primitive_root() {
        if constexpr (mod == 1'000'000'007)
            return 5;
        if constexpr (mod == 998'244'353)
            return 3;
        if constexpr (mod == 786433)
            return 10;

        static int root = -1;
        if (root != -1)
            return root;

        std::vector<int> primes;
        int value = mod - 1;
        for (int i = 2; i * i <= value; i++)
            if (value % i == 0) {
                primes.push_back(i);
                while (value % i == 0)
                    value /= i;
            }

        if (value != 1)
            primes.push_back(value);

        for (int r = 2;; r++) {
            bool ok = true;
            for (auto p : primes)
                if ((mint(r).power((mod - 1) / p)).get() == 1) {
                    ok = false;
                    break;
                }

            if (ok)
                return root = r;
        }
    }
};

// constexpr uint32_t MOD = 1'000'000'007;
constexpr uint32_t MOD = 998'244'353;
using mint = montgomery<MOD>;

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<mint> 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].get() == 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].get() != 0) {
                        w -= x;
                        b.emplace_back(x, i);
                        continue;
                    }
                    update(x);
                }
                rem.push_back(i);
            }
            assert(w == 0);
            a = b;

            bool ignore = find(all(rem), id) != rem.end();
            if (ignore) {
                rem.erase(find(all(rem), id));
            }
            cout << len(rem);
            for (auto i : rem) {
                cout << ' ' << i;
            }
            cout << "\n" << (ignore ? "IGNORE" : "TAKE") << 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);
            a.erase(find(all(a), big[1]));
            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);
    }
}