import sys
input = sys.stdin.readline
MOD = 101
INV6 = pow(6, -1, MOD)


def det(A):
    ret = 0
    for i in range(3):
        ret += A[i][0] * A[(i + 1) % 3][1] * A[(i + 2) % 3][2]
        ret -= A[i][2] * A[(i + 1) % 3][1] * A[(i + 2) % 3][0]
    return ret


def solve(N, K, P, a, s):
    d = abs(det(P))
    if(d == 0):
        return 'D'
    dp = [[[-1] * 4 for _ in [0] * MOD] for _ in [0] * (N + 1)]
    for j in range(MOD):
        dp[N][j][3] = (j >= K)
    for i in range(N - 1, -1, -1):
        is_koa = (s[i] == 'K')
        stat_next = [is_koa, -1, is_koa ^ 1]
        val = a[i] + 1
        val_div = (val % 2 == 0) | ((val % 3 == 0) << 1)
        ni = i + 1
        for j in range(MOD):
            nj = j * val % MOD
            for k in range(4):
                results = [dp[ni][j][k], dp[ni][nj][k | val_div]]
                for x in stat_next:
                    if(x not in results):
                        continue
                    dp[i][j][k] = x
                    break
    stat_init = dp[0][d % MOD * INV6 % MOD][(d % 2 == 0) | ((d % 3 == 0) << 1)]
    if(stat_init == -1):
        return 'D'
    return 'K' if(stat_init) else 'P'


t = int(input())
for _ in [0] * t:
    N, K = map(int, input().split())
    P = [list(map(int, input().split())) for _ in [0] * 3]
    a = list(map(int, input().split()))
    s = input()[:-1]
    print(solve(N, K, P, a, s))