Problem description:
 There are students in a class fighting for a girl. As she came to know she decided that the boy will win who will help her find out specific characters present in a given string is present either "even" or "odd" number of times as asked by her. So help the boys win.

Input
Input description.


First input line consist of t number of test cases.
Next line consists of N, Q i.e. length of string and number of queries
Next input lines consists of string to be searched for
Next Q lines the queries as character to be searched, either "even" or "odd"

 

Output
Output description.

 Each line consists of result "yes" or "no" for each query

 

Constraints

1 <= T <= 100
 1<= N <= 100000
 1<= Q <= 100
 

Example
Input:

1
5 2
aaabb
a even
b odd
Output:

no
no
T = int(raw_input())
for i in range(T):
    (N,Q)= map(int,raw_input().split())
    s = raw_input()
    for j in range(Q):
        l = raw_input().split()
        n = s.count(l[0])%2
        if(l[1]=="even" and n==0):
            print "yes"
        elif(l[1]=="odd" and n==1):
            print "yes"
        else:
            print "no"