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≤ t ≤ 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 ≤ x ≤ n ≤ 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, ..., a_n (1 ≤ a_i ≤ 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 1st case: We must select element 999, and the sum is odd.

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

For 3rd case: We can select element 51.

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

For 5th case: We must select all elements — but overall sum is not odd.
import java.io.*;
import java.util.*;
public class Main {
    static PrintWriter pw;
    static HashMap<Character, HashSet<Character>> adj;
    static StringBuilder sb;
    static boolean[] visit;
    static void dfs(char c) {
        visit[(int)c-(int)'a']=true;
        sb.append(c);
        for(char x: adj.get(c)){
            if(!visit[(int)x-((int)'a')])
                dfs(x);
        }
    }
    public static long gcf(long x, long y) {
        while(x%y!=0 && y%x!=0) {
            if(x>y)
                x%=y;
            else
                y%=x;
        }
        return x>y? y:x;
    }
    static int ceildiv(int x, int y){
        return x%y==0? x/y: x/y+1;
    }
    static long pow(long a, long pow){
        long ans=1;
        while(pow>0){
            if((pow&1)==1)
                ans*=a;
            a*=a;
            pow>>=1;
        }
        return ans;
    }
    static ArrayList<Character>[] arr;
    public static void main(String[] args) throws Exception {
        Input sc = new Input(System.in);
        pw = new PrintWriter(System.out);
        int t=sc.nextInt();
//        while(t-->0){
//            String s=sc.nextLine();
//            ArrayList<Pair> list= new ArrayList<Pair>();
//            for(int i=0; i<s.length(); i++){
//                Pair p=new Pair((int)s.charAt(i)-(int)'0', 1);
//                i++;
//                for(; i<s.length() && (int)s.charAt(i)-(int)'0'==p.x; i++)
//                    p.y++;
//                i--;
//                list.add(p);
//            }
//            if(list.size()<=2){
//                pw.println(0);
//            }else{
//                int ans1=0;
//                int ans2=0;
//                int max=0;
//                for(int i=0; i<list.size(); i+=2){
//                    ans1+=list.get(i).y;
//                    max=Math.max(list.get(i).y, max);
//                }
//                ans1-=max;
//                for(int i=1; i<list.size(); i+=2)
//                    ans2+=list.get(i).y;
//                pw.println(Math.min(ans1, ans2));
//            }
//        }
        while(t-->0){
            int n=sc.nextInt(), x=sc.nextInt();
            int[] arr=sc.nextArr(n);
            int odd=0;
            for(int i=0; i<n; i++)
                odd+=arr[i]%2==1?1:0;
            int even=n-odd;
            boolean yes=false;
            if(odd==0){
                pw.println("NO");
                continue;
            }
            if((x-Math.min(x-1+x%2, (odd-(1-odd%2))))<=even)
                pw.println("YES");
            else
                pw.println("NO");
        }
        pw.close();
    }
    static class Input {
        StringTokenizer st;
        BufferedReader br;
        public Input(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        }

        public Input(FileReader r) {
            br = new BufferedReader(r);
        }

        public String next() throws IOException {
            while (st == null || !st.hasMoreTokens())
                st = new StringTokenizer(br.readLine());
            return st.nextToken();
        }

        public int nextInt() throws IOException {
            return Integer.parseInt(next());
        }

        public long nextLong() throws IOException {
            return Long.parseLong(next());
        }

        public String nextLine() throws IOException {
            return br.readLine();
        }

        public double nextDouble() throws IOException {
            return Double.parseDouble(next());
        }

        public int[] nextArr(int n) throws IOException {
            int[] arr = new int[n];
            for (int i = 0; i < arr.length; i++)
                arr[i] = nextInt();
            return arr;
        }
        public Integer[] nextsort(int n) throws IOException{
            Integer[] arr=new Integer[n];
            for(int i=0; i<n; i++)
                arr[i]=nextInt();
            return arr;
        }
        public boolean ready() throws IOException {
            return br.ready();
        }
    }
    static class Pair implements Comparable<Pair>{
        int x;
        int y;
        public Pair(int x, int y) {
            this.x=x;
            this.y=y;
        }
        public int hashCode() {
            return this.x*1000+this.y;
        }
        public int compareTo(Pair other) {
            if(this.y!=other.y){
                return other.y-this.y;
            }else{
                return (this.x-other.x);
            }
        }
        public boolean equals(Object obj) {
            if (obj == null) {
                return false;
            }
            if (this.getClass() != obj.getClass()) {
                return false;
            }
            Pair p = (Pair) obj;
            return this.x == p.x;
        }
        public boolean equal(Pair p){
            return this.x==p.x && this.y==p.y;
        }
    }
    static class tuple implements Comparable<tuple>{
        int x;int y;int z;
        public tuple(int x, int y, int z){
            this.x=x;
            this.y=y;
            this.z=z;
        }
        public int compareTo(tuple other) {
            if(this.x!=other.x)
                return this.x-other.x;
            else {
                if(this.y!=other.y)
                    return this.y-other.y;
                else
                    return this.z-other.z;
            }
        }
        public boolean equal(tuple t){
            return this.x==t.x && this.y==t.y;
        }
    }
}
