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

def det(p):
    ret = 0
    for i in range(3):
        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


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[-1][j][3] = int(j >= K)
    for i in range(N - 1, -1, -1):
        is_koa = int(s[i] == 'K')
        stat_next = [is_koa, -1, is_koa ^ 1]
        na = a[i] + 1
        nk = (na % 2 == 0) | (1 << (na % 3 == 0))
        for j in range(MOD):
            nj = j * na % MOD
            for k in range(4):
                mov = [dp[i + 1][j][k], dp[i + 1][nj][k | nk]]
                for stat in stat_next:
                    if(stat not in mov):
                        continue
                    dp[i][j][k] = stat
                    break
    # print(d, dp[0][d % MOD * INV6 % MOD])
    g = dp[0][d % MOD * INV6 % MOD][(d % 2 == 0) | (1 << (d % 3 == 0))]
    if(g == -1):
        return 'D'
    return 'K' if(g == 1) 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))