CodeForces-1363A.py

from collections import *
from math import *
from heapq import *
from itertools import *
from queue import *
from cmath import *
from random import *
from functools import *
from time import *
from typing import *
import sys
import os
import decimal

def INPUTS():
   #n = int(sys.stdin.readline().strip())
   #arrary = [int(sys.stdin.readline().strip()) for _ in range(n)]
   
   #SINGLE_INT = lambda:int(input())
   MINGLE_INT = lambda:map(int,input().split())
   
   #SINGLE_STR = lambda:input().strip()
   # MINGLE_STR = lambda:map(str,input().split())
   
   LIST_INT = lambda:list(map(int,input().split()))
   #LIST_INT2 = lambda:list(map(int,input().split()))
   # LIST_STR = lambda:list(map(str,input().split()))
   
   # LIST_SORTED = lambda:sorted(list(map(int,input().split())))
   
   return MINGLE_INT(),LIST_INT()
    

def solution():
   m,l=INPUTS()
   s,i = m
   odd,even = 0,0
   for x in l:
      if x%2 == 0:
         even+=1
      else:
         odd+=1
         
   if odd == 0:
      print('No')
      return
   possible = False
   x = 1
   while x<=odd and x<=i:
      have = min(odd,i)
      need = i-x
      if even>=need:
         possible = True
         break
      x+=2
   
   if possible:
      print('Yes')
      return
   else:
      print('No')
      return
   
def main():
   test_cases = int(input())
   
   for T in range(test_cases):
       solution()
      
       #print(f'Case{T+1}:{solution()}')
   #solution()

if __name__ == '__main__':
   main()