#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int getv(char c) {
	return (c == 'B' ? 2 : (c == 'G'));
}

void solve() {
	int a, b, c;
	cin >> a >> b >> c;
	int maxc = max(a, max(b, c));
	int minc = min(a, min(b, c));
	int midc = 100 - maxc - minc;

	if (maxc <= 57) {
		// Collect every box of first 2 colours you see. Gets 100 - maxc >= 43 boxes
		string cur = "??";
		for (int i = 0; i < 100; ++i) {
			char c;
			cin >> c;
			if (c == cur[0] || cur[0] == '?') {
				cur[0] = c;
				cout << "PLACE 1" << endl;
			} else if (c == cur[1] || cur[1] == '?') {
				cur[1] = c;
				cout << "PLACE 2" << endl;
			} else {
				cout << "DISCARD" << endl;
			}
		}
	} else if (minc <= 19) {
		// Discard every box until you've discarded minc of the colour. Gets 100 - 3 * minc >= 43 boxes
		vector<int> seen(3, 0);
		char cur = '?';

		for (int i = 0; i < 100; ++i) {
			char c;
			cin >> c;
			int v = getv(c);
			if (seen[v] >= minc) {
				if (cur == '?') cur = c;
				if (cur == c) cout << "PLACE 1" << endl;
				else cout << "PLACE 2" << endl;
			} else {
				++seen[v];
				cout << "DISCARD" << endl;
			}
		}
	} else if (midc <= 28) {
		// Collect every box of first 2 colours you see, except that if you see the mid + 1's box of a colour, replace either pile with that
		// 	Gets maxc - midc + minc = 100 - 2 * midc >= 44 boxes

		string cur = "??";
		vector<int> seen(3, 0);
		for (int i = 0; i < 100; ++i) {
			char c;
			cin >> c;

			int v = getv(c);
			if (seen[v] >= midc) {
				if (cur[0] != c && cur[1] != c) {
					cur[0] = c;
					cout << "EMPTY 1" << endl;

				}
			}
			++seen[v];

			if (c == cur[0] || cur[0] == '?') {
				cur[0] = c;
				cout << "PLACE 1" << endl;
			} else if (c == cur[1] || cur[1] == '?') {
				cur[1] = c;
				cout << "PLACE 2" << endl;
			} else {
				cout << "DISCARD" << endl;
			}
		}
	} else {
		assert(false);
	}
}

int main() {
	int t;
	cin >> t;
	for (int ti = 0; ti < t; ++ti) solve();
}