Shubham has an array $a$ of size $n$, and wants to select exactly $x$ elements from it, such that their sum is odd. These elements do not have to be consecutive. The elements of the array are not guaranteed to be distinct.

Tell him whether he can do so.


-----Input-----

The first line of the input contains a single integer $t$ $(1\le t \le 100)$ — the number of test cases. The description of the test cases follows.

The first line of each test case contains two integers $n$ and $x$ $(1 \le x \le n \le 1000)$ — the length of the array and the number of elements you need to choose.

The next line of each test case contains $n$ integers $a_1, a_2, \dots, a_n$ $(1 \le a_i \le 1000)$ — elements of the array.


-----Output-----

For each test case, print "Yes" or "No" depending on whether it is possible to choose $x$ elements such that their sum is odd.

You may print every letter in any case you want.


-----Example-----
Input
5
1 1
999
1 1
1000
2 1
51 50
2 2
51 50
3 3
101 102 103

Output
Yes
No
Yes
Yes
No



-----Note-----

For $1$st case: We must select element $999$, and the sum is odd.

For $2$nd case: We must select element $1000$, so overall sum is not odd.

For $3$rd case: We can select element $51$.

For $4$th case: We must select both elements $50$ and $51$  — so overall sum is odd.

For $5$th case: We must select all elements  — but overall sum is not odd.

Difficulty: interview

Starter code:

Solutions:
q = int(input())
for ii in range(q):
	n,x = map(int,input().split())
	l = list(map(int,input().split()))
	par = 0
	npar = 0
	for i in l:
		if i%2 == 1:
			npar += 1
		else:
			par += 1
	if x == n:
		if npar%2 == 1:
			print("Yes")
		else:
			print("No")
	else:
		if npar > 0 and par > 0:
			print("Yes")
		else:
			if par == 0:
				if x%2 == 1:
					print("Yes")
				else:
					print("No")
			else:
				print("No")

T = int(input())

for _ in range(T):
    n,x = map(int,input().split())
    a = list(map(int,input().split()))
    p,q = 0,0
    for i in a:
        if i % 2 == 0:
            p += 1
        else:
            q += 1
    ok = False
    for i in range(p + 1):
        j = x - i
        if j < 0 or j > q:
            continue
        if j % 2 == 1:
            ok = True
            break
    if ok:
        print('Yes')
    else:
        print('No')

for _ in range(int(input())):
    n, x = map(int, input().split())
    # n = int(input())
    arr = list(map(int, input().split()))
    a = 0
    b = 0
    for el in arr:
        if el % 2 == 1:
            a += 1
        if el % 2 == 0:
            b += 1
    if a == 0:
        print("No")
        continue
    if x == n:
        if a % 2 == 0:
            print("No")
        else:
            print("Yes")
        continue
    if x % 2 == 0:
        if b == 0:
            print("No")
        else:
            print("Yes")
    else:
        print("Yes")

def f():
    n, x = list(map(int, input().split()))

    a = list(map(int, input().split()))

    odds = 0
    for i in a:
        if i % 2 == 1:
            odds += 1

    if odds == n:
        if x % 2 == 1:
            return "Yes"
        else:
            return "No"
    elif odds == 0:
        return "No"
    else:
        if x == n and odds % 2 == 0:
            return "No"
        else:
            return "Yes"

t = int(input())

for _ in range(t):
    print(f())


for t in range(int(input())):
    n, x = list(map(int, input().split()))
    a = list(map(int, input().split()))
    odd = sum(map(lambda x: x % 2 == 1, a))
    even = sum(map(lambda x: x % 2 == 0, a))
    total = sum(a) % 2
    if x == n:
        if total:
            print("Yes")
        else:
            print("No")
    else:
        if odd == 0:
            print("No")
        else:
            if x % 2 == 1:
                print("Yes")
            else:
                if even:
                    print("Yes")
                else:
                    print("No")

t= int(input())
for _ in range(t):
    n, x = list(map(int, input().split()))
    A = list(map(int, input().split()))
    odd = 0
    even = 0
    for i in range(n):
        if A[i]%2 == 1:
            odd += 1
        else:
            even += 1
    flag =False
    for j in range(x+1):
        if j%2 == 1 and j <= odd and (x-j) <= even:
            flag = True
            break
    if flag:
        print('Yes')
    else:
        print('No')


t = int(input())
for q in range(0, t):
    # n = int(input())
    n, x = list(map(int, input().split()))
    arr = list(map(int, input().split()))
    a = 0
    for i in range(0, n):
        if arr[i] % 2 == 1:
            a += 1
    if a == n and x % 2 == 0:
        print("No")
    elif a == 0:
        print("No")
    elif x == n and a % 2 == 0:
        print("No")
    else:
        print("Yes")



from math import *

def r1(t):
    return t(input().strip())

def r2(t):
    return [t(i) for i in input().strip().split()]

def r3(t):
    return [t(i) for i in input().strip()]

for _ in range(int(input())):
    n, x = r2(int)
    a = r2(int)
    co = 0
    ce = 0
    for i in a:
        if i % 2 == 0:
            ce += 1
        else:
            co += 1

    if ((x == n) and co % 2 == 0) or co <= 0 or (ce == 0 and x % 2 == 0):
        print('No')
    else:
        print('Yes')


t = int(input())
for _ in range(t):
    n, x = [int(x) for x in input().split()]
    arr = [int(x) for x in input().split()]
    assert len(arr) == n
    num_odd = len([a for a in arr if a % 2 == 1])
    num_even = len([a for a in arr if a % 2 == 0])

    # o <= odd, e <= even, o+e = x, o is odd
    for i in range(num_odd+1):
        if i % 2 == 1 and 0 <= x - i <= num_even:
            print("Yes")
            break
    else:
        print("No")
    


for _ in range(int(input())):
    n, m = map(int, input().split())
    A = list(map(int, input().split()))
    ch = 0
    nch = 0
    for i in range(n):
        if A[i] % 2 == 1:
            nch += 1
        else:
            ch += 1
    if n == m:
        if sum(A) % 2 == 1:
            print('Yes')
        else:
            print('No')
    else:
        if ch > 0 and nch > 0:
            print('Yes')
        elif nch > 0 and m % 2 == 1:
            print('Yes')
        else:
            print('No')

import math
t=int(input())
for i in range(t):
    n,x=list(map(int,input().split()))
    a=list(map(int,input().split()))
    evencount=0
    oddcount=0
    for j in range(n):
        if a[j]%2==0:
            evencount+=1
        else:
            oddcount+=1
    if oddcount==0:
        print('No')
    elif evencount==0:
        if x%2==1:
            print('Yes')
        else:
            print('No')
    else:
        if x<n:
            print('Yes')
        elif oddcount%2==1:
            print('Yes')
        else:
            print('No')