rt

#include<bits/stdc++.h>
using namespace std;
int a[55],b[55];
int in(){
    string str;
    cin>>str;
    str.pop_back();
    int num=0;
    if(str=="A") num=14;
    else if(str=="K") num=13;
    else if(str=="Q") num=12;
    else if(str=="J") num=11;
    else if(str=="T") num=10;
    else num=stoi(str);
    return num;
}
int main(){
    int T;
    cin>>T;
    while(T--){
        int n,m;
        cin>>n>>m;
        for(int i=0;i<n;i++) a[i]=in();
        for(int i=0;i<n;i++) b[i]=in();
        int P=in();
        sort(a,a+n);
        sort(b,b+n);int big=a[lower_bound(a,a+n,P)-a-1];
        // cout<<endl<<big<<endl<<endl;
        if(n==1||b[0]>=P||a[0]>=P){cout<<"Shou"<<endl;continue;}
        if(m==1&&b[0]>big){cout<<"Shou"<<endl;continue;}
        if(m==1&&b[0]<P){cout<<"Pang"<<endl;continue;}
        if(m>=2&&b[0]<P&&b[1]<P){cout<<"Pang"<<endl;continue;}
        if(n>3&&b[0]<=big&&b[n-1]<a[n-1]&&a[0]<P&&a[1]<P){cout<<"Pang"<<endl;continue;}
        cout<<"Shou"<<endl;
    }
    return 0;
}