#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <numeric>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <functional>
#include <iomanip>
using namespace std;
using ll = long long;

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n_):i({0}),n({n_}){}range(int i_,int n_):i({i_}),n({n_}){}I& begin(){return i;}I& end(){return n;}};

template<typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p){ return os << "{" << p.first << ", " << p.second << "}"; }
template<typename T> ostream& operator<<(ostream& os, const vector<T>& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T> ostream& operator<<(ostream& os, const set<T>& obj) { os << "set{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& obj) { os << "map{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T> void take(vector<T>& vec, int n) { vec.resize(n); for (int i = 0; i < n; ++i) cin >> vec[i]; }

#ifdef ONLINE_JUDGE
#define dump(expr) ;
#else
#define dump(expr) { cerr << "\033[33m#L" << __LINE__ << ": " << expr << "\033[39m" << endl; }
#endif

namespace solver {

template<typename T1, typename T2> struct In2 {
  T1 a; T2 b;
  friend std::istream& operator>>(std::istream& is, In2& obj) { T1 t1; T2 t2; is >> t1 >> t2; obj = {t1, t2}; return is; }
};

template<typename T1, typename T2, typename T3> struct In3 {
  T1 a; T2 b; T3 c;
  friend std::istream& operator>>(std::istream& is, In3& obj) { T1 t1; T2 t2; T3 t3; is >> t1 >> t2 >> t3; obj = {t1, t2, t3}; return is; }
};

int n, K;
vector<ll> vp;
vector<ll> va;
string s;

void read() {
  cin >> n >> K;
  take(vp, 9);
  take(va, n);
  cin >> s;
}

using RetType = string;

RetType run() {
  // 0 1 2
  // 3 4 5
  // 6 7 8
  ll V = vp[0] * vp[4] * vp[8];
  V   += vp[1] * vp[5] * vp[6];
  V   += vp[2] * vp[3] * vp[7];
  V   -= vp[0] * vp[5] * vp[7];
  V   -= vp[1] * vp[3] * vp[8];
  V   -= vp[2] * vp[4] * vp[6];

  V = llabs(V);

  if (V == 0) return "D";

  int M = 606;
  vector<int> dp(M);

  for (int i : range(M)) if (i % 6 == 0) {
    dp[i] = (i / 6 >= K) ? +1 : -1;
  }

  dump(dp);
  for (int k = n - 1; k >= 0; --k) {
    vector<int> next(M);

    for (int i = 0; i < M; ++i) {
      int a = va[k] + 1;
      if (s[k] == 'K') {
        next[i] = max(dp[i], dp[i * a % M]);
      } else {
        next[i] = min(dp[i], dp[i * a % M]);
      }
    }

    dp.swap(next);

    dump(dp);
  }

  V = V % M;
  dump(V);
  if (dp[V] == +1) return "K";
  if (dp[V] == -1) return "P";
  return "D";
}

}  // namespace

template <typename F>
void run(F f) { if constexpr (std::is_same_v<decltype(f()), void>) f(); else cout << f() << endl; }

int main(int argc, char** argv) {
  cerr << fixed << setprecision(12);
  cout << fixed << setprecision(12);
  int testcase;
  cin >> testcase;
  while (testcase--) {
    solver::read();
    run(solver::run);
  }
}