# WA

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 = 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] = (j >= K)
    for i in range(N - 1, -1, -1):
        a = A[i] + 1
        div2, div3 = (a % 2 == 0), (a % 3 == 0)
        player = (S[i] == 'K')
        for j in range(MOD):
            nj = j * a % MOD
            for k in range(4):
                nk = k | div2 | (div3 << 1)
                mv = [dp[i + 1][j][k], dp[i + 1][nj][nk]]
                if(player in mv):
                    dp[i][j][k] = player
                elif(-1 in mv):
                    dp[i][j][k] = -1
                else:
                    dp[i][j][k] = player ^ 1
    ij = d % MOD * INV6 % MOD
    ik = (d % 2 == 0) | ((d % 3 == 0) << 1)
    if(dp[0][ij][ik] == 1):
        return 'K'
    elif(dp[0][ij][ik] == -1):
        return 'D'
    else:
        return '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))