import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum M = 606;

void main() {
  try {
    for (; ; ) {
      const numCases = readInt;
      foreach (caseId; 0 .. numCases) {
        const N = readInt;
        const K = readInt;
        auto P = new long[3][3];
        foreach (i; 0 .. 3) foreach (j; 0 .. 3) {
          P[i][j] = readLong;
        }
        auto A = new long[N];
        foreach (i; 0 .. N) {
          A[i] = readLong;
        }
        const S = readToken;
        
        long det;
        foreach (i; 0 .. 3) {
          det += P[0][0] * (P[1][1] * P[2][2] - P[1][2] * P[2][1]);
          P = P[1 .. 3] ~ P[0 .. 1];
        }
        debug {
          writeln("det = ", det);
        }
        
        auto dp = new int[][](N + 1, M);
        for (int r = 0; r < M; r += 6) {
          dp[N][r] = (r / 6 >= K) ? +1 : -1;
        }
        foreach_reverse (i; 0 .. N) {
          foreach (x; 0 .. M) {
            const y = (x * (1 + A[i])) % M;
            dp[i][x] = (S[i] == 'K') ? max(dp[i + 1][x], dp[i + 1][y]) : min(dp[i + 1][x], dp[i + 1][y]);
          }
        }
        const ans = det ? dp[0][abs(det) % M] : 0;
        writeln((ans > 0) ? "K" : (ans < 0) ? "P" : "D");
      }
    }
  } catch (EOFException e) {
  }
}