#define ATCODER #define _USE_MATH_DEFINES #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using ll = long long; using ld = long double; using pll = pair; using pdd = pair; //template using pq = priority_queue, greater>; #define FOR(i, a, b) for(ll i=(a); i<(b);i++) #define REP(i, n) for(ll i=0; i<(n);i++) #define ROF(i, a, b) for(ll i=(b-1); i>=(a);i--) #define PER(i, n) for(ll i=n-1; i>=0;i--) #define REPREP(i,j,a,b) for(ll i=0;i > #define VV2(type,n,m,val) vector< vector > val;val.resize(n);for(ll i;i #define VEC(type,n,val) vector val;val.resize(n) #define VL vector #define VVL vector< vector > #define VP vector< pair > #define SZ size() #define all(i) begin(i),end(i) #define SORT(i) sort(all(i)) #define BITI(i) (1<>i) & 1) != 0) #define ALLBIT(n) (ll(1)<v?v:n #define MP(a,b) make_pair(a,b) #define DET2(x1,y1,x2,y2) (x1)*(y2)-(x2)*(y1) #define DET3(x1,y1,z1,x2,y2,z2,x3,y3,z3) (x1)*(y2)*(z3)+(x2)*(y3)*(z1)+(x3)*(y1)*(z2)-(z1)*(y2)*(x3)-(z2)*(y3)*(x1)-(z3)*(y1)*(x2) #define INC(a) for(auto& v:a)v++; #define DEC(a) for(auto& v:a)v--; #define SQU(x) (x)*(x) #define L0 ll(0) #ifdef ATCODER #include using namespace atcoder; using mint = modint1000000007; using mint2 = modint998244353; #endif template vector read(size_t n) { vector ts(n); for (size_t i = 0; i < n; i++) cin >> ts[i]; return ts; } template void read_tuple_impl(TV&) {} template void read_tuple_impl(TV& ts) { get(ts).emplace_back(*(istream_iterator(cin))); read_tuple_impl(ts); } template decltype(auto) read_tuple(size_t n) { tuple...> ts; for (size_t i = 0; i < n; i++) read_tuple_impl(ts); return ts; } //using val = tuple; //using func = ll; // //val op(val a, val b) { // auto [a1, a2, a3, a4] = a; // auto [b1, b2, b3, b4] = b; // return make_tuple(a1 + b1, a2 + b2, max(a3, b3), a4 + b4); //} // //val e() { return make_tuple(0, 0, 0, 0); } // //val mp(func f, val a) //{ // if (f < 0) // return a; // auto [a1, a2, a3, a4] = a; // return make_tuple(a2 * f, a2, f, a4); //} //func comp(func f, func g) { // if (f < 0) // return g; // return f; //} ll di[4] = { 1,0,-1,0 }; ll dj[4] = { 0,1,0,-1 }; ll si[4] = { 0,3,3,0 }; ll sj[4] = { 0,0,3,3 }; //ll di[4] = { -1,-1,1,1 }; //ll dj[4] = { -1,1,-1,1 }; ll di8[8] = { 0,-1,-1,-1,0,1,1,1 }; ll dj8[8] = { -1,-1,0,1,1,1,0,-1 }; void solve() { ll n, k; cin >> n >> k; VVL p(3); REP(i, 3) p[i] = read(3); ll b = DET3(p[0][0], p[0][1], p[0][2], p[1][0], p[1][1], p[1][2], p[2][0], p[2][1], p[2][2]); b = abs(b); vector wl(606, 1); REP(i, 101) { if (i < k) { wl[i * 6] = 0; } else { wl[i * 6] = 2; } } VL a = read(n); string s; cin >> s; if (b == 0) { cout << "D\n"; return; } PER(i, n) { vector nwl(606, 1); ll v = a[i] + 1; REP(j, 606) { if (s[i] == 'K') { if (wl[j * v % 606] == 2 || wl[j] == 2) { nwl[j] = 2; } if (wl[j * v % 606] == 0 && wl[j] == 0) { nwl[j] = 0; } } else { if (wl[j * v % 606] == 0 || wl[j] == 0) { nwl[j] = 0; } if (wl[j * v % 606] == 2 && wl[j] == 2) { nwl[j] = 2; } } } wl = nwl; } if (wl[b % 606]==2) { cout << "K\n"; } else if (wl[b % 606] == 1) { cout << "D\n"; } else { cout << "P\n"; } return; } int main() { ll t = 1; cin >> t; while (t--) { solve(); } return 0; }