#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define MOD 101
using namespace std;
using ll = long long;

int powmod(int a, int n) {
    int ret = 1;
    while(n){
        if(n & 1){
            ret *= a;
            ret %= MOD;
        }
        n >>= 1;
        a *= a;
        a %= MOD;
    }
    return ret;
}
const int INV6 = powmod(2, MOD - 2);

ll det(vector<vector<ll> >& P){
    ll ret = 0;
    for(int i = 0; i < 3; ++i){
        ret += P[i][0] * P[(i + 1) % 3][1] * P[(i + 2) % 3][2];
        ret -= P[i][2] * P[(i + 1) % 3][1] * P[(i + 2) % 3][0];
    }
    return ret;
}


int get_dp(vector<vector<vector<int> > >& dp, vector<int>& a, string& s, int i, int j, int k){
    if(dp[i][j][k] == -2){
        int nj = j * (a[i] + 1) % MOD, nk = k | ((a[i] + 1) % 2 == 0) | (((a[i] + 1) % 3 == 0) << 1);
        vector<int> results = { get_dp(dp, a, s, i + 1, j, k), get_dp(dp, a, s, i + 1, nj, nk) };
        vector<int> stat_next = (s[i] == 'K') ? vector<int>({1, -1, 0}) : vector<int>({0, -1, 1});
        for(auto& x : stat_next){
            if(find(all(results), x) == results.end()){
                continue;
            }
            dp[i][j][k] = x;
            break;
        }
    }
    return dp[i][j][k];
}


char solve(int N, int K, vector<vector<ll> >& P, vector<int>& a, string& s){
    ll d = abs(det(P));
    if(d == 0){
        return 'D';
    }
    vector<vector<vector<int> > > dp(N + 1, vector<vector<int> >(MOD, vector<int>(4, -2)));
    for(int j = 0; j < MOD; ++j){
        for(int k = 0; k < 3; ++k){
            dp[N][j][k] = -1;
        }
        dp[N][j][3] = (j >= K) ? 1 : 0;
    }
    int g = get_dp(dp, a, s, 0, (int)(d % MOD) * INV6 % MOD, (d % 2 == 0) | ((d % 3 == 0) << 1));
    if(g == -1){
        return 'D';
    }
    return (g == 1) ? 'K' : 'P';
}


int main(){
    int t;  cin >> t;

    for(int i = 0; i < t; ++i){
        int N, K;  cin >> N >> K;
        vector<vector<ll> > P(3, vector<ll>(3));
        for(auto& v : P){
            cin >> v[0] >> v[1] >> v[2];
        }
        vector<int> a(N);
        for(auto& x : a){
            cin >> x;
        }
        string s;  cin >> s;
        cout << solve(N, K, P, a, s) << endl;
    }

    return 0;
}