#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr)
#define ll long long
#define fi first
#define se second
#define int long long
#define no "NO\n"
#define yes "YES\n"
#define pb push_back
#define endl "\n"
#define dbg(x...) do{cout<<#x<<" -> ";err(x);}while (0)
void err() { cout << '\n'; }

template<class T, class... Ts>
void err(T arg, Ts... args) {
    cout << arg << ' ';
    err(args...);
}

const int N = 1e6 + 7;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e9 + 7;
const double eps = 1e-8;
const double pi = acos(-1.0);

int getnum(string s){
	if(s[0] == '1'){
			return 1;
	}else if(s[0]>='2'&&s[0]<='9'){
		return s[0]-'0';
	}else if(s[0] == 'J') return 11;
	else if(s[0]=='Q') return 12;
	else if(s[0]=='K') return 13;
	else if(s[0] == 'A') return 14;	
	else if(s[0]=='T')	return 10;
}
int a[N],b[N];
void  solve(){
	int n,m;
	cin >> n >> m;
	for(int i=1;i<=n;i++){
		string s;
		cin >> s;
		a[i] = getnum(s);
	}
	for(int i=1;i<=m;i++){
		string s;
		cin >> s;
		b[i] = getnum(s);
	}
	sort(a+1,a+1+n);
	sort(b+1,b+1+m);
	string s;
	cin >> s;
    int p = getnum(s);
    int y = lower_bound(a+1,a+1+n,p)-a-1;
    int x = lower_bound(b+1,b+1+m,p)-b-1;
	if(a[1]>=p||n==1){cout << "Shou" << endl;return;}
	if(x>=2) cout << "Pang" << endl;
	else if(x==0) cout << "Shou" << endl;
	else if(x==1){
		if(m==1){
			if(a[y]>=b[1]) cout << "Pang" << endl;
			else cout << "Shou" << endl;
		}else{
			if(y==1){
				cout << "Shou" << endl;
			}else{
				if(a[n]<=b[m]){
					cout<<"Shou"<<endl;
					return;
				}else{
					if(a[y]>=b[1]&&n>3){
					cout << "Pang" << endl;
			    	}else cout << "Shou" << endl;
				}
			}
		}
	}
}	

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(nullptr),cout.tie(nullptr);
  	int T=1;
  	cin >>T;
  	while(T--) solve();
    return 0;
}