#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
const int mod=998244353;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a,bool upp=0){if(a) cout<<(upp?"YES\n":"Yes\n"); else cout<<(upp?"NO\n":"No\n");}
template<class T> void vec_out(vector<T> &p,int ty=0){
if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}


void solve();
// oddloop
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int t=1;
    cin>>t;
    rep(i,0,t) solve();
}

void solve(){
    ll N,K;
    cin>>N>>K;
    vector p(3,vector<ll>(3));
    rep(i,0,3) rep(j,0,3) cin>>p[i][j];
    vector<ll> q(3);
    rep(j,0,3){
        int a=(j+1)%3,b=(j+2)%3;
        q[j]+=p[0][a]*p[1][b];
        q[j]-=p[1][a]*p[0][b];
    }
    ll tmp=0;
    rep(j,0,3) tmp+=q[j]*p[2][j];
    tmp=abs(tmp);
    vector<int> dp(606);
    rep(i,0,606) if(i%6==0){
        if(i>=K*6) dp[i]=1;
        else dp[i]=-1;
    }
    vector<ll> A(N);
    rep(i,0,N) cin>>A[i];
    string S;
    cin>>S;
    for(int i=N-1;i>=0;i--){
        vector<int> n_dp(606);
        rep(j,0,606){
            int a=j;
            int b=(j*(A[i]+1))%606;
            n_dp[j]=(S[i]=='K'?max(dp[a],dp[b]):min(dp[a],dp[b]));
        }
        swap(n_dp,dp);
    }
    if(tmp==0){
        cout<<"D\n";
        return;
    }
    tmp%=606;
    if(dp[tmp]==1) cout<<"K\n";
    if(dp[tmp]==0) cout<<"D\n";
    if(dp[tmp]==-1)cout<<"P\n";
}