import sys
sys.setrecursionlimit(10 ** 5)
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 = [[[-2] * 4 for _ in [0] * MOD] for _ in [0] * (N + 1)]
    for j in range(MOD):
        for k in range(3):
            dp[N][j][k] = -1
        dp[N][j][3] = int(j >= K)
    stat_next = [[1, -1, 0], [0, -1, 1]]
    def get_dp(i, j, k):
        if(dp[i][j][k] != -2):
            return dp[i][j][k]
        nj, nk = j * (a[i] + 1) % MOD, k | ((a[i] + 1) % 2 == 0) | (((a[i] + 1) % 3 == 0) << 1)
        results = [get_dp(i + 1, j, k), get_dp(i + 1, nj, nk)]
        for x in stat_next[(s[i] == 'P')]:
            if(x not in results):
                continue
            dp[i][j][k] = x
            return x
        print(i, j, k, stat_next, results)
        assert(False)
    g = get_dp(0, d % MOD * INV6 % MOD, (d % 2 == 0) | ((d % 3 == 0) << 1))
    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))