#include<bits/stdc++.h>
#define rep(i, a, b) for(int i = (a);i <= (b);++i)
#define per(i, a, b) for(int i = (a);i >= (b);--i)
#define lc (k << 1)
#define rc (k << 1 | 1)
#define lowbit(x) ((x) & -(x))
#define odd(x) ((x) & 1)
#define even(x) (!odd(x))
#define fir first
#define sec second
#define pb push_back
#define il inline
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define i128 __int128
#define f128 __float128
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define SZ(x) ((int)(x).size())
#define debug(x) cerr << "In Line " << __LINE__ << " the " << #x << " = " << (x) << "\n"
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<class T> using vc = vector<T>;
template<class Tx, class Ty>
il void chkmx(Tx& x, const Ty y) {x = max<common_type_t<Tx, Ty>>(x, y);}
template<class Tx, class Ty>
il void chkmn(Tx& x, const Ty y) {x = min<common_type_t<Tx, Ty>>(x, y);}
const int inf = 0x3f3f3f3f;
const ll llinf = 0x3f3f3f3f3f3f3f3fll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
bool ms;

void solve() {
    int cnt[3];
    cin >> cnt[0] >> cnt[1] >> cnt[2];
    sort(cnt, cnt + 3);
    auto get = [&]() -> int {
        char c;
        cin >> c;
        if(c == 'R')
            return 0;
        if(c == 'G')
            return 1;
        return 2;
    };
    if(cnt[0] + cnt[1] >= 43) {
        rep(i, 1, 100) {
            int t = get();
            if(!t)
                cout << "DISCARD" << endl;
            else
                cout << "PLACE " << t << endl;
        }
    } else {
        int x = 1, y = 2;
        int ct[3]{};
        bool flag = 0;
        rep(i, 1, 100) {
            int t = get();
            ++ct[t];
            if(ct[t] > cnt[1] && t != x && t != y) {
                if(ct[y] > ct[x]) {
                    cout << "EMPTY 1" << endl;
                    x = t;
                } else {
                    cout << "EMPTY 2" << endl;
                    y = t;
                }
                flag = 1;
            }
            if(flag && ct[t] > cnt[0] && t != x && t != y) {
                if(cnt[1] - cnt[0] > cnt[0]) {
                    if(ct[y] > ct[x]) {
                        cout << "EMPTY 1" << endl;
                        x = t;
                    } else {
                        cout << "EMPTY 2" << endl;
                        y = t;
                    }
                }
            }
            if(t == x)
                cout << "PLACE 1" << endl;
            else if(t == y)
                cout << "PLACE 2" << endl;
            else
                cout << "DISCARD" << endl;
        }
    }
}

bool mt;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    cerr << fabs(&ms - &mt) / 1024 / 1024 << "\n";
    int t;
    cin >> t;
    while(t--)
        solve();
    cerr << 1e3 * clock() / CLOCKS_PER_SEC << " ms\n";
    return 0;
}