// MagicDark
#include <bits/stdc++.h>
#define debug cerr << "[" << __LINE__ << "] "
#define SZ(x) (int) x.size() - 1
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> inline void chkmax(T &x, T y) {x = max(x, y);}
template <typename T> inline void chkmin(T &x, T y) {x = min(x, y);}
template <typename T> inline void read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	x *= f;
}
const int N = 55;
int n, m, a[N], b[N];
// string a[N], b[N];
int rd() {
	string st; cin >> st;
	if (isdigit(st[0])) return st[0] - '1';
	if (st[0] == 'T') return 9;
	if (st[0] == 'J') return 10;
	if (st[0] == 'Q') return 11;
	if (st[0] == 'K') return 12;
	return 13;
}
void zhk() {
	read(n), read(m);
	F(i, 1, n) a[i] = rd();
	F(i, 1, m) b[i] = rd();
	sort(a + 1, a + n + 1), sort(b + 1, b + m + 1);
	// F(i, 1, n) cout << a[i] << " "; cout << endl;
	// F(i, 1, n) cout << b[i] << " "; cout << endl;
	int t = rd(), nn = n;
	// cout << t << endl;
	while (n && a[n] >= t) n--;
	if (!n) return puts("Shou"), void();
	if (nn == 1) return puts("Shou"), void();
	if (b[1] >= t) return puts("Shou"), void();
	if (m == 1 || b[2] >= t) {
		if (a[n] >= b[1]) {
			if ((nn > 3 && n >= 2 && a[nn] > b[m]) || m == 1) puts("Pang");
			else puts("Shou");
			return;
		}
		return puts("Shou"), void();
	}
	puts("Pang");
}
signed main() {
	int _ = 1;
	cin >> _;
	while (_--) zhk();
	return 0;
}
/* why?
*/