#include <stdio.h>
#include <stdlib.h>

int solve(int N, int K, long long p[][3], int A[], char S[])
{
	long long x = llabs(p[0][0] * p[1][1] * p[2][2] + p[0][1] * p[1][2] * p[2][0] + p[0][2] * p[1][0] * p[2][1] - (p[0][0] * p[1][2] * p[2][1] + p[0][1] * p[1][0] * p[2][2] + p[0][2] * p[1][1] * p[2][0]));
	if (x == 0) return 0;

	int i, j, jj, cur, prev, dp[2][606];
	for (j = 0; j < 606; j++) dp[0][j] = (j % 6 != 0)? 0: (j / 6 >= K)? 1: -1;
	for (i = N - 1, cur = 1, prev = 0; i >= 0; i--, cur ^= 1, prev ^= 1) {
		if (S[i] == 'K') {
			for (j = 0; j < 606; j++) {
				jj = j * (A[i] + 1) % 606;
				if (dp[prev][j] > 0 || dp[prev][jj] > 0) dp[cur][j] = 1;
				else if (dp[prev][j] == 0 || dp[prev][jj] == 0) dp[cur][j] = 0;
				else dp[cur][j] = -1;
			}
		} else {
			for (j = 0; j < 606; j++) {
				jj = j * (A[i] + 1) % 606;
				if (dp[prev][j] < 0 || dp[prev][jj] < 0) dp[cur][j] = -1;
				else if (dp[prev][j] == 0 || dp[prev][jj] == 0) dp[cur][j] = 0;
				else dp[cur][j] = 1;
			}
		}
	}
	return dp[prev][x%606];
}

int main()
{
	int T, i, j, N, K, A[10001], ans;
	long long p[3][3];
	char S[10001];
	scanf("%d", &T);
	while (T--) {
		scanf("%d %d", &N, &K);
		for (i = 0; i < 3; i++) for (j = 0; j < 3; j++) scanf("%lld", &(p[i][j]));
		for (i = 0; i < N; i++) scanf("%d", &(A[i]));
		scanf("%s", S);
		ans = solve(N, K, p, A, S);
		if (ans > 0) printf("K\n");
		else if (ans < 0) printf("P\n");
		else printf("D\n");
	}
	fflush(stdout);
	return 0;
}