+ , -- or ?

Input

The first line contains single integer $t$ (1 \le t \le 10^4) — the number of test cases.

The first line of each test case contains two integers $n,k$ (1 \le k < n \le 500) – the length of array and the length of the window.

The second line of each test case contains $n$ separated integers a_1,a_2,..,a_n (1 \le a_1,a_2,..,a_n \le 10^9) — the array $a$.

The third line of each test case contains a string $s$ of length $k$ describing the desired interval in $a$.

It's guaranteed that sum of n \cdot k doesn't exceed 500^2.

Output

For each test case , print "YES" if exists ; otherwise, print "NO".

You can output the answer in any case (For example, the strings "yEs", "yes", "Yes", and "YeS" will be recognized as positive responses).

Examples

Note

In the first test case , the string stands for $+?+$ thus $+?$ is a part of that string.

In the second test case , the string stands for $---$ which is also can be read as $???$

In the third test case , the string stands for $?-?+$ thus $?-?$ is a part of the string.

In the fourth test case , the string stands for $+--$ thus $+-+$ isn't a part of the string.

In the fifth test case , the string stands for $??+-$ thus $-?$ is a part of string because you can do following scenario:

• you may decide that first character to be read as $-$ and keep the second character as $?$

Scoring

1. Subtask $1$ ($10$ points) : (a_1<a_2<a_3<...<a_n)

2. Subtask $2$ ($10$ points) : (s_1=s_2=...=s_k=\mathtt{?})

3. Subtask $3$ ($10$ points) : (k=n-1)

4. Subtask $4$ ($20$ points) : (s_i \in \{\mathtt{+,-}\})

5. Subtask $5$ ($50$ points) : No additional constraints