#include <map>
#include <set>
#include <array>
#include <cmath>
#include <deque>
#include <bitset>
#include <random>
#include <string>
#include <vector>
#include <cassert>
#include <complex>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;

const int M = 1000;
const int NEED = 600;

void solve() {
  int n;
  cin >> n;
  vector<pair<int, int>> cur; // (val, ind)
  vector<pair<int, int>> new_cur;
  vector<int> leave;
  int cur_sum = 0;
  for (int i = 0; i < n; ++i) {
    int x;
    cin >> x;
    cur_sum += x;
    cur.emplace_back(x, i);
    if (cur_sum <= M) {
      cout << 0 << '\n';
      cout << "TAKE" << endl;
    } else {
      sort(cur.rbegin(), cur.rend());
      new_cur.clear();
      leave.clear();
      cur_sum = 0;
      for (auto [x, i] : cur) {
        if (cur_sum + x <= M) {
          cur_sum += x;
          new_cur.emplace_back(x, i);
        } else {
          leave.emplace_back(i);
        }
      }
      if (cur_sum >= NEED) {
        bool leave_cur = false;
        for (int j : leave) {
          if (j == i)
            leave_cur = true;
        }
        cout << int(leave.size()) - leave_cur << ' ';
        for (int j : leave) {
          if (j != i)
            cout << j + 1 << ' ';
        }
        cout << '\n';
        if (leave_cur)
          cout << "IGNORE";
        else
          cout << "TAKE";
        cout << endl;
        swap(cur, new_cur);
      } else {
        int j = 0;
        while (cur[j].second != i)
          ++j;
        cur.erase(cur.begin() + j);
        cout << 0 << '\n';
        cout << "IGNORE" << endl;
      }
    }
  }
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}