def can_k_win(n, k, stones):
# 动态规划表，dp[i][j][c]表示在区间[i, j]内，当前玩家已经拿了c个青色石头时，当前玩家是否有必胜策略
dp = [[[False] * (k + 1) for _ in range(n)] for _ in range(2)]
t = int(input())
for _ in range(t):
n, k = map(int, input().split())
stones = input().strip()
if can_k_win(n, k, stones):
print("YES")
else:
print("NO")
