import sys
input = sys.stdin.readline
MOD = 101
INV = 6
IMOD = MOD * INV


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] * IMOD for _ in [0] * (N + 1)]
    for j in range(0, IMOD, INV):
        dp[N][j] = int(j // INV >= K)
    for i in range(N - 1, -1, -1):
        is_koa = int(s[i] == 'K')
        stat_next = [is_koa, -1, is_koa ^ 1]
        val = a[i] + 1
        ni = i + 1
        for j in range(IMOD):
            nj = j * val % IMOD
            results = [dp[ni][j], dp[ni][nj]]
            for x in stat_next:
                if(x not in results):
                    continue
                dp[i][j] = x
                break
    stat_init = dp[0][d % IMOD]
    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))