#include <bits/stdc++.h>
using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t;
    cin>>t;
    while(t--)
    {
        long long int n,x,sum=0,i,p=0,flag=0;
        cin>>n>>x;
        long long int a[n+10];
        for(i=0;i<n;i++)
        {
            cin>>a[i];
            if(a[i]%2!=0)
            sum=a[i];
        }
        if(sum%2!=0){p++;flag=1;}
        if(p!=x)
        {
            for(i=0;i<n;i++)
            {
                if(a[i]%2==0&&flag==1)
                {
                    p++;
                }
            }
        }
        if(p>=x){cout<<"YES";}
        else{cout<<"NO";}
    }
    return 0;
}


#include <bits/stdc++.h>
using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t;
    cin>>t;
    while(t--)
    {
        long long int n,x,sum=0,i,p=0,q=0,flag=0;
        cin>>n>>x;
        long long int a[n+10];
        for(i=0;i<n;i++)
        {
            cin>>a[i];
            if(a[i]%2!=0)
            {
                flag=1;
                q++;
            }
        }
        if(q%2==0){q--;}
        for(i=0;i<n&&q!=0;i++)
        {
            if(a[i]%2!=0)
            {
                sum+=a[i];
                q--;
                p++;
            }
        }
        if(p<x)
        {
            for(i=0;i<n;i++)
            {
                if(a[i]%2==0&&flag==1)
                {
                    p++;
                }
            }
        }
        if(p>=x){cout<<"YES"<<"\n";}
        else{cout<<"NO"<<"\n";}
    }
    return 0;
}


#include <bits/stdc++.h>
using namespace std;

#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long

const int N = 2e5 + 5;

int n, x;
int a[N], f[2];

int32_t main()
{
	IOS;
	int t;
	cin >> t;
	while(t--)
	{
	    f[0] = f[1] = 0;
    	cin >> n >> x;
    	for(int i = 1; i <= n; i++)
    	{
    		cin >> a[i];
    		f[a[i] % 2]++;
    	}
    	bool flag = 0;
    	for(int i = 1; i <= f[1] && i <= x; i += 2) //Fix no of odd
    	{
    		int have = f[0], need = x - i;
    		if(need <= f[0])
    	        flag = 1;
    	}
    	if(flag)
    	    cout << "Yes" << endl;
    	else
    	    cout << "No" << endl;
	}
	return 0;
}


#include <bits/stdc++.h>
using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t;
    cin>>t;
    while(t--)
    {
        long long int n,x,sum=0,i,p=0,flag=0;
        cin>>n>>x;
        long long int a[n+10];
        for(i=0;i<n;i++)
        {
            cin>>a[i];
            if(a[i]%2!=0)
            sum=a[i];
        }
        if(sum%2!=0){p++;flag=1;}
        if(p!=x)
        {
            for(i=0;i<n;i++)
            {
                if(a[i]%2==0&&flag==1)
                {
                    p++;
                }
            }
        }
        if(p>=x){cout<<"YES"<<"\n";}
        else{cout<<"NO"<<"\n";}
    }
    return 0;
}


#include <bits/stdc++.h>
using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t;
    cin>>t;
    while(t--)
    {
        int n,x,sum=0,i,p=0,flag=0;
        cin>>n>>x;
        int a[n+10];
        for(i=0;i<n;i++)
        {
            cin>>a[i];
            if(a[i]%2!=0)
            sum=a[i];
        }
        if(sum%2!=0){p++;flag=1;}
        if(p!=x)
        {
            for(i=0;i<n;i++)
            {
                if(a[i]%2==0&&flag==1)
                {
                    p++;
                }
            }
        }
        if(p>=x){cout<<"YES";}
        else{cout<<"NO";}
    }
    return 0;
}


		#include<string.h>
		#include<iostream>
		#include<cstdio>
		#include<algorithm>
		using namespace std;
		typedef long long ll;
		int a[100000],c=0,b=0;
		int main()
		{
			int _;
			scanf("%d", &_);
			for (int i = 1; i <= _; i++)
			{
				int x,y;
				scanf("%d%d", &x, &y);
				for (int j=1; j <= x; j++) {
					scanf("%d", &a[j]);
					if (a[j] % 2 == 0)c++;
					if (a[j] % 2 != 0)b++;
				}
				if (y == 1 && b >= 1)printf("Yes\n");
				else if (y > 1 && y > c && ((y - c) % 2 == 1 || y - c == 1) && b >= 1)printf("Yes\n");
				else if (y > 1 && y > c && y<(c+b)&&y%2!=0)printf("Yes\n");
				else if (y > 1 && y == c&& b >0)printf("Yes\n");
				else if (y > 1 && y < c && y>b &&(b%2==1||b==1))printf("Yes\n");
				else if (y < c && y < b )printf("Yes\n");
				else printf("No\n");
				c = 0; b = 0;
			}
			return 0;
		}


#include<string.h>
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
int a[100000],c=0,b=0;
int main()
{
	int _;
	scanf("%d", &_);
	for (int i = 1; i <= _; i++)
	{
		int x,y;
		scanf("%d%d", &x, &y);
		for (int j=1; j <= x; j++) {
			scanf("%d", &a[j]);
			if (a[j] % 2 == 0)c++;
			if (a[j] % 2 != 0)b++;
		}
		if (y == 1 && b >= 1)printf("Yes\n");
		else if (y > 1 && ((y - c) % 2 == 1||y-c==1) && b >= 1)printf("Yes\n");
		else printf("No\n");
		c = 0; b = 0;
	}
	return 0;
}


		#include<string.h>
		#include<iostream>
		#include<cstdio>
		#include<algorithm>
		using namespace std;
		typedef long long ll;
		int a[100000],c=0,b=0;
		int main()
		{
			int _;
			scanf("%d", &_);
			for (int i = 1; i <= _; i++)
			{
				int x,y;
				scanf("%d%d", &x, &y);
				for (int j=1; j <= x; j++) {
					scanf("%d", &a[j]);
					if (a[j] % 2 == 0)c++;
					if (a[j] % 2 != 0)b++;
				}
				if (y == 1 && b >= 1)printf("Yes\n");
				else if (y > 1 && y > c && ((y - c) % 2 == 1 || y - c == 1) && b >= 1)printf("Yes\n");
				else if (y > 1 && y > c && ((y - c) % 2 == 1 && y - c != 0) && b >= y - c)printf("Yes\n");
				else if (y > 1 && y < c && y>b &&(b%2==1||b==1))printf("Yes\n");
				else if (y < c && y < b )printf("Yes\n");
				else printf("No\n");
				c = 0; b = 0;
			}
			return 0;
		}


		#include<string.h>
		#include<iostream>
		#include<cstdio>
		#include<algorithm>
		using namespace std;
		typedef long long ll;
		int a[100000],c=0,b=0;
		int main()
		{
			int _;
			scanf("%d", &_);
			for (int i = 1; i <= _; i++)
			{
				int x,y;
				scanf("%d%d", &x, &y);
				for (int j=1; j <= x; j++) {
					scanf("%d", &a[j]);
					if (a[j] % 2 == 0)c++;
					if (a[j] % 2 != 0)b++;
				}
				if ( c< y)
				{
					int d=y-c;
					if (d == 1)printf("Yes\n");
					else if (b-d > 0 && c)printf("Yes\n");
					else printf("No\n");
				}
				else {
					if (b)printf("Yes\n");
					else printf("No\n");
				}
				c = 0; b = 0;
			}
			return 0;
		}


		#include<string.h>
		#include<iostream>
		#include<cstdio>
		#include<algorithm>
		using namespace std;
		typedef long long ll;
		int a[100000],c=0,b=0;
		int main()
		{
			int _;
			scanf("%d", &_);
			for (int i = 1; i <= _; i++)
			{
				int x,y;
				scanf("%d%d", &x, &y);
				for (int j=1; j <= x; j++) {
					scanf("%d", &a[j]);
					if (a[j] % 2 == 0)c++;
					if (a[j] % 2 != 0)b++;
				}
				if (y == 1 && b >= 1)printf("Yes\n");
				else if (y > 1 && y > c && ((y - c) % 2 == 1 || y - c == 1) && b >= 1)printf("Yes\n");
				else if (y > 1 && y > c && y<c+b)printf("Yes\n");
				else if (y > 1 && y == c&& b >0)printf("Yes\n");
				else if (y > 1 && y < c && y>b &&(b%2==1||b==1))printf("Yes\n");
				else if (y < c && y < b )printf("Yes\n");
				else printf("No\n");
				c = 0; b = 0;
			}
			return 0;
		}


#include<string.h>
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
int a[100000],c=0,b=0;
int main()
{
	int _;
	scanf("%d", &_);
	for (int i = 1; i <= _; i++)
	{
		int x,y;
		scanf("%d%d", &x, &y);
		for (int j=1; j <= x; j++) {
			scanf("%d", &a[j]);
			if (a[j] % 2 == 0)c++;
			if (a[j] % 2 != 0)b++;
		}
		if (y == 1 && b >= 1)printf("Yes\n");
		else if (y > 1 && ((y - c) % 2 == 1 || y - c == 1) && b >= 1)printf("Yes\n");
		else if (y > 1 && ((y - c) % 2 == 1&&y-c!=0) && b>=(y-c)%2)printf("Yes");
		else printf("No\n");
		c = 0; b = 0;
	}
	return 0;
}


#include<string.h>
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
int a[100000],c=0,b=0;
int main()
{
	int _;
	scanf("%d", &_);
	for (int i = 1; i <= _; i++)
	{
		int x,y;
		scanf("%d%d", &x, &y);
		for (int j=1; j <= x; j++) {
			scanf("%d", &a[j]);
			if (a[j] % 2 == 0)c++;
			if (a[j] % 2 != 0)b++;
		}
		if (y == 1 && b >= 1)printf("Yes\n");
		else if (y > 1 && ((y - c) % 2 == 1 || y - c == 1) && b >= 1)printf("Yes\n");
		else if (y > 1 && (y - c) % 2 == 0 && b % 2 == 1)printf("Yes");
		else printf("No\n");
		c = 0; b = 0;
	}
	return 0;
}


#include<string.h>
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
int a[100000],c=0,b=0;
int main()
{
	int _;
	scanf("%d", &_);
	for (int i = 1; i <= _; i++)
	{
		int x,y;
		scanf("%d%d", &x, &y);
		for (int j=1; j <= x; j++) {
			scanf("%d", &a[j]);
			if (a[j] % 2 == 0)c++;
			if (a[j] % 2 != 0)b++;
		}
		if (y == 1 && b >= 1)printf("Yes\n");
		else if (y > 1 && y > c && ((y - c) % 2 == 1 || y - c == 1) && b >= 1)printf("Yes\n");
		else if (y > 1 && y > c && ((y - c) % 2 == 1 && y - c != 0) && b >= y - c)printf("Yes");
		else if (y > 1 && y < c && y>b &&(b%2==1||b==1))printf("Yes");
		else if (y < c && y < b && y % 2 == 1)printf("Yes");
		else printf("No\n");
		c = 0; b = 0;
	}
	return 0;
}


		#include<string.h>
		#include<iostream>
		#include<cstdio>
		#include<algorithm>
		using namespace std;
		typedef long long ll;
		int a[100000],c=0,b=0;
		int main()
		{
			int _;
			scanf("%d", &_);
			for (int i = 1; i <= _; i++)
			{
				int x,y;
				scanf("%d%d", &x, &y);
				for (int j=1; j <= x; j++) {
					scanf("%d", &a[j]);
					if (a[j] % 2 == 0)c++;
					if (a[j] % 2 != 0)b++;
				}
				if ( c< y)
				{
					int d=y-c;
					if (d == 1)printf("Yes\n");
					else if (d - b > 0 && c)printf("Yes\n");
					else printf("No\n");
				}
				else {
					if (b)printf("Yes\n");
					else printf("No\n");
				}
				c = 0; b = 0;
			}
			return 0;
		}


		#include<string.h>
		#include<iostream>
		#include<cstdio>
		#include<algorithm>
		using namespace std;
		typedef long long ll;
		int a[100000],c=0,b=0;
		int main()
		{
			int _;
			scanf("%d", &_);
			for (int i = 1; i <= _; i++)
			{
				int x,y;
				scanf("%d%d", &x, &y);
				for (int j=1; j <= x; j++) {
					scanf("%d", &a[j]);
					if (a[j] % 2 == 0)c++;
					if (a[j] % 2 != 0)b++;
				}
				if ( c< y)
				{
					int d=y-c;
					if (d %2== 1)printf("Yes\n");
					else if (b-d > 0 && c)printf("Yes\n");
					else printf("No\n");
				}
				else {
					if (b)printf("Yes\n");
					else printf("No\n");
				}
				c = 0; b = 0;
			}
			return 0;
		}


#include<string.h>
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
int a[100000],c=0,b=0;
int main()
{
	int _;
	scanf("%d", &_);
	for (int i = 1; i <= _; i++)
	{
		int x,y;
		scanf("%d%d", &x, &y);
		for (int j=1; j <= x; j++) {
			scanf("%d", &a[j]);
			if (a[j] % 2 == 0)c++;
			if (a[j] % 2 != 0)b++;
		}
		if (y == 1 && b >= 1)printf("Yes\n");
		else if (y > 1 && y > c && ((y - c) % 2 == 1 || y - c == 1) && b >= 1)printf("Yes\n");
		else if (y > 1 && y > c && ((y - c) % 2 == 1 && y - c != 0) && b >= (y - c) % 2)printf("Yes");
		else if (y > 1 && y < c && y>b && ((y - b) % 2 == 0 || y - b == 0))printf("Yes");
		else if (y < c && y < b && y % 2 == 1)printf("Yes");
		else printf("No\n");
		c = 0; b = 0;
	}
	return 0;
}


		#include<string.h>
		#include<iostream>
		#include<cstdio>
		#include<algorithm>
		using namespace std;
		typedef long long ll;
		int a[100000],c=0,b=0;
		int main()
		{
			int _;
			scanf("%d", &_);
			for (int i = 1; i <= _; i++)
			{
				int x,y;
				scanf("%d%d", &x, &y);
				for (int j=1; j <= x; j++) {
					scanf("%d", &a[j]);
					if (a[j] % 2 == 0)c++;
					if (a[j] % 2 != 0)b++;
				}
				if (y == 1 && b >= 1)printf("Yes\n");
				else if (y > 1 && y >= c && ((y - c) % 2 == 1 || y - c == 1) && b >= 1)printf("Yes\n");
				else if (y > 1 && y >= c && ((y - c) % 2 == 1 && y - c != 0) && b >= y - c)printf("Yes\n");
				else if (y > 1 && y < c && y>b &&(b%2==1||b==1))printf("Yes\n");
				else if (y < c && y < b )printf("Yes\n");
				else printf("No\n");
				c = 0; b = 0;
			}
			return 0;
		}


#include<string.h>
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
int a[100000],c=0,b=0;
int main()
{
	int _;
	scanf("%d", &_);
	for (int i = 1; i <= _; i++)
	{
		int x,y;
		scanf("%d%d", &x, &y);
		for (int j=1; j <= x; j++) {
			scanf("%d", &a[j]);
			if (a[j] % 2 == 0)c++;
			if (a[j] % 2 != 0)b++;
		}
		if (y == 1 && b >= 1)printf("Yes\n");
		else if (y > 1 && ((y - c) % 2 == 1 || y - c == 1) && b >= 1)printf("Yes\n");
		else if (y > 1 && ((y - c) % 2 == 1&&y-c!=0) && b % 2 == 1)printf("Yes");
		else printf("No\n");
		c = 0; b = 0;
	}
	return 0;
}


	#include<string.h>
	#include<iostream>
	#include<cstdio>
	#include<algorithm>
	using namespace std;
	typedef long long ll;
	int a[100000],c=0,b=0;
	int main()
	{
		int _;
		scanf("%d", &_);
		for (int i = 1; i <= _; i++)
		{
			int x,y;
			scanf("%d%d", &x, &y);
			for (int j=1; j <= x; j++) {
				scanf("%d", &a[j]);
				if (a[j] % 2 == 0)c++;
				if (a[j] % 2 != 0)b++;
			}
			if (y == 1 && b >= 1)printf("Yes\n");
			else if (y > 1 && y > c && ((y - c) % 2 == 1 || y - c == 1) && b >= 1)printf("Yes\n");
			else if (y > 1 && y > c && ((y - c) % 2 == 1 && y - c != 0) && b >= y - c)printf("Yes");
			else if (y > 1 && y < c && y>b &&(b%2==1||b==1))printf("Yes");
			else if (y < c && y < b )printf("Yes");
			else printf("No\n");
			c = 0; b = 0;
		}
		return 0;
	}


#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define pb push_back

int main()
{
    int t;
    cin >> t;
    while(t--)
    {
        int n, x;
        cin >> n >> x;
        vector<int> odd;
        vector<int> even;
        while(n--)
        {
            int a;
            cin >> a;
            if(a%2 == 1)
            {
                odd.pb(a);
            }
            else
            {
                even.pb(a);
            }
        }
        int o = 0;
        if(odd.size()%2 == 0)
        {
            o = odd.size()-1;
        }
        else
        {
            o = odd.size();
        }
        if(x - o > even.size())
        {
            cout << "No" << endl;
        }
        else
        {
            cout << "Yes" << endl;
        }
    }
}


#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define pb push_back

int main()
{
    int t;
    cin >> t;
    while(t--)
    {
        int n, x;
        cin >> n >> x;
        vector<int> odd;
        vector<int> even;
        while(n--)
        {
            int a;
            cin >> a;
            if(a%2 == 1)
            {
                odd.pb(a);
            }
            else
            {
                even.pb(a);
            }
        }
        int o;

        if(odd.size() != 0 && odd.size()%2 == 0)
        {
            o = odd.size()-1;
        }
        else if (odd.size() == 0)
        {
            cout << "No" << endl;
            continue;
        }
        else
        {
            o = odd.size();
        }

        if(x - o > even.size())
        {
            cout << "No" << endl;
        }
        else
        {
            cout << "Yes" << endl;
        }
    }
}


#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define pb push_back

int main()
{
    int t;
    cin >> t;
    while(t--)
    {
        int n, x;
        cin >> n >> x;
        vector<int> odd;
        vector<int> even;
        while(n--)
        {
            int a;
            cin >> a;
            if(a%2 == 1)
            {
                odd.pb(a);
            }
            else
            {
                even.pb(a);
            }
        }
        int o;

        if(odd.size()%2 == 0)
        {
            o = odd.size()-1;
        }
        else
        {
            o = odd.size();
        }

        if(o == -1 || x - o > even.size())
        {
            cout << "No" << endl;
        }
        else
        {
            cout << "Yes" << endl;
        }
    }
}


#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define pb push_back

int main()
{
    int t;
    cin >> t;
    while(t--)
    {
        int n, x;
        cin >> n >> x;
        vector<int> odd;
        vector<int> even;
        while(n--)
        {
            int a;
            cin >> a;
            if(a%2 == 1)
            {
                odd.pb(a);
            }
            else
            {
                even.pb(a);
            }
        }

        if(odd.size() == 0)
        {
            cout << "No" << endl;
            continue;
        }

        int o;

        if(odd.size()%2 == 0)
        {
            o = odd.size()-1;
        }
        else
        {
            o = odd.size();
        }

        while(o > x)
        {
            o -= 2;
        }

        if(o > 0)
        {
            if(x - o <= even.size())
            {
                cout << "Yes" << endl;
            }
            else
            {
                cout << "No" << endl;
            }
        }
        else
        {
            cout << "No" << endl;
        }
    }
}


#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define pb push_back

int main()
{
    int t;
    cin >> t;
    while(t--)
    {
        int n, x;
        cin >> n >> x;
        vector<int> odd;
        vector<int> even;
        while(n--)
        {
            int a;
            cin >> a;
            if(a%2 == 1)
            {
                odd.pb(a);
            }
            else
            {
                even.pb(a);
            }
        }
        int o;
        if(odd.size() == 0)
        {
            o = -2;
        }
        else if(odd.size()%2 == 0)
        {
            o = odd.size()-1;
        }
        else
        {
            o = odd.size();
        }

        if(o == -2 || x - o > even.size())
        {
            cout << "No" << endl;
        }
        else
        {
            cout << "Yes" << endl;
        }
    }
}


#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define pb push_back

int main()
{
    int t;
    cin >> t;
    while(t--)
    {
        int n, x;
        cin >> n >> x;
        vector<int> odd;
        vector<int> even;
        while(n--)
        {
            int a;
            cin >> a;
            if(a%2 == 1)
            {
                odd.pb(a);
            }
            else
            {
                even.pb(a);
            }
        }
        if(odd.size() == 0)
        {
            cout << "No" << endl;
            return 0;
        }

        if(odd.size()%2 == 0)
        {
            o = odd.size()-1;
        }
        else
        {
            o = odd.size();
        }
        if(x - o > even.size())
        {
            cout << "No" << endl;
        }
        else
        {
            cout << "Yes" << endl;
        }
    }
}


#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define pb push_back

int main()
{
    int t;
    cin >> t;
    while(t--)
    {
        int n, x;
        cin >> n >> x;
        vector<int> odd;
        vector<int> even;
        while(n--)
        {
            int a;
            cin >> a;
            if(a%2 == 1)
            {
                odd.pb(a);
            }
            else
            {
                even.pb(a);
            }
        }

        if(odd.size() == 0)
        {
            cout << "No" << endl;
        }

        int o;

        if(odd.size()%2 == 0)
        {
            o = odd.size()-1;
        }
        else
        {
            o = odd.size();
        }

        while(o > x)
        {
            o -= 2;
        }

        if(o > 0)
        {
            if(x - o <= even.size())
            {
                cout << "Yes" << endl;
            }
            else
            {
                cout << "No" << endl;
            }
        }
        else
        {
            cout << "No" << endl;
        }
    }
}


#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define pb push_back

int main()
{
    int t;
    cin >> t;
    while(t--)
    {
        int n, x;
        cin >> n >> x;
        vector<int> odd;
        vector<int> even;
        while(n--)
        {
            int a;
            cin >> a;
            if(a%2 == 1)
            {
                odd.pb(a);
            }
            else
            {
                even.pb(a);
            }
        }
        if(odd.size() == 0)
        {
            cout << "No" << endl;
            return 0;
        }
        int o = 0;

        if(odd.size()%2 == 0)
        {
            o = odd.size()-1;
        }
        else
        {
            o = odd.size();
        }
        if(x - o > even.size())
        {
            cout << "No" << endl;
        }
        else
        {
            cout << "Yes" << endl;
        }
    }
}


#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <map>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <cctype>
#include <cmath>
#include <cassert>

#define INF 0x3f3f3f3f
#define PI 3.14159265358979323846

using namespace std;

typedef long long ll;

const ll mod=1000000007;
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}

template<class T>inline void read(T &res)
{
	char c;T flag=1;
	while((c=getchar())<'0'||c>'9')if(c=='-')flag=-1;res=c-'0';
	while((c=getchar())>='0'&&c<='9')res=res*10+c-'0';res*=flag;
}

const int N=1005;

int t;
int n,x;

int a[N];

int main()
{
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d",&n,&x);
		int js=0;
		int os=0;
		for(int i=0;i<n;i++)
		{
			scanf("%d",&a[i]);
			if(a[i]%2==0)
			{
				os++;
			}
			else
			{
				js++;
			}
		}
		if(x%2==1)
		{//我需要奇数个和为奇数
			if(js%2==1)
			{
				printf("Yes\n");
			}
			else
			{
				//x-=(js-1);
				if(os>=x-js+1||js>=x-os+1)
				{
					printf("Yes\n");
				}
				else
				{
					printf("No\n");
				}
			}
		}
		else
		{
			if(js%2==1)
			{
				printf("Yes\n");
			}
			else
			{
				if((os>=(x-1)&&js>0)||(js>=(x-1)&&os>0))
				{
					printf("Yes\n");
					continue;
				}
				printf("No\n");
			}
		}
	}
	return 0;
}


#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <map>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <cctype>
#include <cmath>
#include <cassert>

#define INF 0x3f3f3f3f
#define PI 3.14159265358979323846

using namespace std;

typedef long long ll;

const ll mod=1000000007;
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}

template<class T>inline void read(T &res)
{
	char c;T flag=1;
	while((c=getchar())<'0'||c>'9')if(c=='-')flag=-1;res=c-'0';
	while((c=getchar())>='0'&&c<='9')res=res*10+c-'0';res*=flag;
}

const int N=1005;

int t;
int n,x;

int a[N];

int main()
{
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d",&n,&x);
		int js=0;
		int os=0;
		for(int i=0;i<n;i++)
		{
			scanf("%d",&a[i]);
			if(a[i]%2==0)
			{
				os++;
			}
			else
			{
				js++;
			}
		}
		if(x%2==1)
		{//我需要奇数个和为奇数
			if(js%2==1)
			{
				printf("Yes\n");
			}
			else
			{
				if(js==0)
				{
					printf("No\n");
					continue;
				 }
				if(js>=x)
				{//奇数个数大于x
					if(x%2==1)
					{
						printf("Yes\n");
					}
					else
					{
						printf("No\n");
					}
				}
				else
				{//奇数个数小于x
					int sy=x-js+1;
					if(os>=sy)
					{
						printf("Yes\n");
					}
					else
					{
						printf("No\n");
					}
				}
				//x-=(js-1);
//				if(os>=x-js+1||js>=x-os+1)
//				{
//					printf("Yes\n");
//				}
//				else
//				{
//					printf("No\n");
//				}
			}
		}
		else
		{
			if(js%2==1&&os>0)
			{
				printf("Yes\n");
			}
			else
			{
				if(js==0)
				{
					printf("No\n");
					continue;
				}
				if(js<=x&&os>0)
				{
					printf("Yes\n");
					continue;
				}
				if(js>x&&os>0)
				{
					printf("Yes\n");
					continue;
				}
				printf("No\n");
//				else
//				{
//					printf("No\n");
//				}
//				int sy=x-(js-1);
//				if(os>=sy)
//				{
//					printf("Yes\n");
//				}
//				else
//				{
//					printf("No\n");
//				}
//				if((os>=(x-1)&&js>0)||(js>=(x-1)&&os>0))
//				{
//					printf("Yes\n");
//					continue;
//				}
//				printf("No\n");
			}
		}
	}
	return 0;
}


#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <map>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <cctype>
#include <cmath>
#include <cassert>

#define INF 0x3f3f3f3f
#define PI 3.14159265358979323846

using namespace std;

typedef long long ll;

const ll mod=1000000007;
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}

template<class T>inline void read(T &res)
{
	char c;T flag=1;
	while((c=getchar())<'0'||c>'9')if(c=='-')flag=-1;res=c-'0';
	while((c=getchar())>='0'&&c<='9')res=res*10+c-'0';res*=flag;
}

const int N=1005;

int t;
int n,x;

int a[N];

int main()
{
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d",&n,&x);
		int js=0;
		int os=0;
		for(int i=0;i<n;i++)
		{
			scanf("%d",&a[i]);
			if(a[i]%2==1)
			{
				js++;
			}
			else
			{
				os++;
			}
		}
		if(js==0)
		{//奇数都没有的话，必定是不可能的
			printf("No\n");
			continue;
		}

		if(os==0)
		{//如果偶数为0,说明剩下全是奇数 ，那就好办了，只要看x就行
		//如果x为偶数，偶数个相加不可能为奇数
			if(x%2==0)
			{
				printf("No\n");
			}
			else
			{//奇数个没问题的，ok的
				printf("Yes\n");
			}
			continue;
		}

		//把奇数为0和偶数为0都判好了，下面开始最麻烦的，奇数偶数都有

		//对于结果的奇偶性，  偶数个数其实不影响结果，只有奇数个数才会影响

		//可以这么构造，一个奇数，剩下全是偶数，这个情况比较好，但是会出现偶数不够用的情况

		x-=1;
		js--;
		if(os>=x)
		{//偶数个数够的，理想情况
			printf("Yes\n");
		}
		else
		{//不够，怎么办，2个奇数换一个偶数
			int num=js/2;
			if(os>=x-num*2)
			{//够用
				printf("Yes\n");
			}
			else
			{
				printf("No\n");
			}
		}
	}
	return 0;
}


#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <map>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <cctype>
#include <cmath>
#include <cassert>

#define INF 0x3f3f3f3f
#define PI 3.14159265358979323846

using namespace std;

typedef long long ll;

const ll mod=1000000007;
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}

template<class T>inline void read(T &res)
{
	char c;T flag=1;
	while((c=getchar())<'0'||c>'9')if(c=='-')flag=-1;res=c-'0';
	while((c=getchar())>='0'&&c<='9')res=res*10+c-'0';res*=flag;
}

const int N=1005;

int t;
int n,x;

int a[N];

int main()
{
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d",&n,&x);
		int js=0;
		int os=0;
		for(int i=0;i<n;i++)
		{
			scanf("%d",&a[i]);
			if(a[i]%2==0)
			{
				os++;
			}
			else
			{
				js++;
			}
		}

		if(js%2==1)
		{
			if(x%2==0&&os%2==0)
			{
				printf("No\n");
				continue;
			}
			printf("Yes\n");
		}
		else
		{
			printf("No\n");
		}
	}
	return 0;
}


#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <map>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <cctype>
#include <cmath>
#include <cassert>

#define INF 0x3f3f3f3f
#define PI 3.14159265358979323846

using namespace std;

typedef long long ll;

const ll mod=1000000007;
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}

template<class T>inline void read(T &res)
{
	char c;T flag=1;
	while((c=getchar())<'0'||c>'9')if(c=='-')flag=-1;res=c-'0';
	while((c=getchar())>='0'&&c<='9')res=res*10+c-'0';res*=flag;
}

const int N=1005;

int t;
int n,x;

int a[N];

int main()
{
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d",&n,&x);
		int js=0;
		int os=0;
		for(int i=0;i<n;i++)
		{
			scanf("%d",&a[i]);
			if(a[i]%2==0)
			{
				os++;
			}
			else
			{
				js++;
			}
		}
		if(x%2==1)
		{//我需要奇数个和为奇数
			if(js%2==1)
			{
				printf("Yes\n");
			}
			else
			{
				x-=(js-1);
				if(os>=x)
				{
					printf("Yes\n");
				}
				else
				{
					printf("No\n");
				}
			}
		}
		else
		{
			if(js%2==1)
			{
				printf("Yes\n");
			}
			else
			{
				printf("No\n");
			}
		}
	}
	return 0;
}


#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <map>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <cctype>
#include <cmath>
#include <cassert>

#define INF 0x3f3f3f3f
#define PI 3.14159265358979323846

using namespace std;

typedef long long ll;

const ll mod=1000000007;
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}

template<class T>inline void read(T &res)
{
	char c;T flag=1;
	while((c=getchar())<'0'||c>'9')if(c=='-')flag=-1;res=c-'0';
	while((c=getchar())>='0'&&c<='9')res=res*10+c-'0';res*=flag;
}

const int N=1005;

int t;
int n,x;

int a[N];

int main()
{
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d",&n,&x);
		int js=0;
		int os=0;
		for(int i=0;i<n;i++)
		{
			scanf("%d",&a[i]);
			if(a[i]%2==1)
			{
				js++;
			}
			else
			{
				os++;
			}
		}
		if(js==0)
		{//奇数都没有的话，必定是不可能的
			printf("No\n");
			continue;
		}

		if(os==0)
		{//如果偶数为0,说明剩下全是奇数 ，那就好办了，只要看x就行
		//如果x为偶数，偶数个相加不可能为奇数
			if(x%2==0)
			{
				printf("No\n");
			}
			else
			{//奇数个没问题的，ok的
				printf("Yes\n");
			}
			continue;
		}

		//把奇数为0和偶数为0都判好了，下面开始最麻烦的，奇数偶数都有

		//对于结果的奇偶性，  偶数个数其实不影响结果，只有奇数个数才会影响

		//可以这么构造，一个奇数，剩下全是偶数，这个情况比较好，但是会出现偶数不够用的情况

		x-=1;
		js--;
		if(os>=x)
		{//偶数个数够的，理想情况
			printf("Yes\n");
		}
		else
		{//不够，怎么办，2个奇数换一个偶数
			int num=js/2;
			if(x-num*2<=0)
			{//够用
				printf("Yes\n");
			}
			else
			{
				printf("No\n");
			}
		}
	}
	return 0;
}


#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <map>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <cctype>
#include <cmath>
#include <cassert>

#define INF 0x3f3f3f3f
#define PI 3.14159265358979323846

using namespace std;

typedef long long ll;

const ll mod=1000000007;
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}

template<class T>inline void read(T &res)
{
	char c;T flag=1;
	while((c=getchar())<'0'||c>'9')if(c=='-')flag=-1;res=c-'0';
	while((c=getchar())>='0'&&c<='9')res=res*10+c-'0';res*=flag;
}

const int N=1005;

int t;
int n,x;

int a[N];

int main()
{
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d",&n,&x);
		int js=0;
		int os=0;
		for(int i=0;i<n;i++)
		{
			scanf("%d",&a[i]);
			if(a[i]%2==0)
			{
				os++;
			}
			else
			{
				js++;
			}
		}

		if(js%2==1)
		{
			if(x%2==0&&os%2==0)
			{
				printf("No\n");
				continue;
			}
			printf("Yes\n");
		}
		else
		{
			if(x==2&&os!=0)
			{
				printf("Yes\n");
				continue;
			}
			printf("No\n");
		}
	}
	return 0;
}


#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <map>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <cctype>
#include <cmath>
#include <cassert>

#define INF 0x3f3f3f3f
#define PI 3.14159265358979323846

using namespace std;

typedef long long ll;

const ll mod=1000000007;
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}

template<class T>inline void read(T &res)
{
	char c;T flag=1;
	while((c=getchar())<'0'||c>'9')if(c=='-')flag=-1;res=c-'0';
	while((c=getchar())>='0'&&c<='9')res=res*10+c-'0';res*=flag;
}

const int N=1005;

int t;
int n,x;

int a[N];

int main()
{
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d",&n,&x);
		int js=0;
		int os=0;
		for(int i=0;i<n;i++)
		{
			scanf("%d",&a[i]);
			if(a[i]%2==0)
			{
				os++;
			}
			else
			{
				js++;
			}
		}
		if(x%2==1)
		{//我需要奇数个和为奇数
			if(js%2==1)
			{
				printf("Yes\n");
			}
			else
			{
				x-=(js-1);
				if(os>=x)
				{
					printf("Yes\n");
				}
				else
				{
					printf("No\n");
				}
			}
		}
		else
		{
			if(js%2==1)
			{
				printf("Yes\n");
			}
			else
			{
				if(os>=(x-1)||js>=(x-1))
				{
					printf("Yes\n");
					continue;
				}
				printf("No\n");
			}
		}
	}
	return 0;
}


#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <string>
#include <cmath>
#define LL long long
#define PI 3.141592653589
using namespace std;
LL t,n,m,x,k;
int a[10005];
int main()
{
	cin>>t;
	while(t--)
	{
		int num=0,sum=0;
	    cin>>n>>x;
		 for(int i=1;i<=n;i++)
		       {cin>>a[i];
		         if(a[i]%2==1) num++;
		         else sum++;
			   }
			   k=0;
		 for(int i=0;i<=sum;i++)
		  for(int j=1;j<=num;j+=2)
		  {
		  	if(i+j==x) {cout<<"YES"<<endl;break;k=1;}

		  }
	    if(!k) cout<<"NO"<<endl;
  }
	return 0;
}


#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <string>
#include <cmath>
#define LL long long
#define PI 3.141592653589
using namespace std;
LL t,n,m,x,k;
int a;
int main()
{
	cin>>t;
	while(t--)
	{
		int num=0,sum=0;
	    cin>>n>>x;
		 for(int i=1;i<=n;i++)
		 {
		       cin>>a;
		       if(a%2==0) sum++;
		       else num++;
	    }
	    if(x%2==0){
	    	if(num>=x) cout<<"NO"<<endl;
	    	else if(x>num&&num%2==1&&(x-num)>=sum) cout<<"YES"<<endl;
	    	else cout<<"NO"<<endl;
		}
		else {
			if(num>=x) cout<<"YES"<<endl;
			else if(x>num&&num%2==1&&(x-num)>=sum) cout<<"YES"<<endl;
			else cout<<"NO"<<endl;
		}
  }
	return 0;
}


#include<iostream>
#include<map>
#include<set>
#include<vector>
#include<algorithm>
#include<cstring>
#include<string>
#include<queue>
#include<functional>
#include<cmath>
using namespace std;
#define mem0(a) memset(a, 0, sizeof(a));
#define mem1(a) memset(a, -1, sizeof(a));
#define pi 3.141592653;
const int inf = 0x3f3f3f3f;
const int N = 1010;
typedef pair<int, int> pii;
typedef long long ll;
int a[N];
int main()
{
	int t;
	cin >> t;
	while(t --)
	{
		int n, k;
		cin >> n >> k;
		int num_0 = 0, num_1 = 0;
		for(int i = 0; i < n; i ++)
		{
			cin >> a[i];
			if(a[i] % 2 == 0)
				num_0 ++;
			else
				num_1 ++;
		}
		if(k == n)
		{
			if(num_1 % 2 == 0)
				cout << "No" << endl;
			else
				cout << "Yes" << endl;
			continue;
		}
		if(k % 2 == 1)
		{

			if(num_1 > 0)
				cout << "Yes" << endl;
			else
				cout << "No" << endl;
		}
		else
		{
			if(num_0 == 0)
				cout << "No" << endl;
			else
				cout << "Yes" << endl;
		}
	}
	return 0;
}


#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <string>
#include <cmath>
#define LL long long
#define PI 3.141592653589
using namespace std;
LL t,n,m,x,k;
int a[10005];
int main()
{
	cin>>t;
	while(t--)
	{
		int num=0,sum=0,num1=0;
	    cin>>n>>x;
		 for(int i=1;i<=n;i++)
		       cin>>a[i];
		    sort(a+1,a+n+1);
		for(int i=1;i<=n;i++){
			if(a[i]%2==1&&a[i]!=a[i+1]&&a[i]!=a[i-1]) num++;
			else if(a[i]%2==1&&a[i]==a[i+1]) num1++;
			else sum++;
		}
	    if(sum>=x&&num) cout<<"YES"<< endl;
	    else if(sum<x&&(x-sum)>=num&&(x-sum)%2==1) cout<<"YES"<<endl;
	    else if(sum<x&&(x-sum)>num&&(x-sum)%2==0) cout<<"YES"<<endl;
	    else if(num>=x&&x%2==1) cout<<"YES"<<endl;
	    else if(num<x&&num%2==1&&(x-num)>=sum) cout<<"YES"<<endl;
	    else cout<<"NO"<<endl;
  }
	return 0;
}


#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <string>
#include <cmath>
#define LL long long
#define PI 3.141592653589
using namespace std;
LL t,n,m,x,k;
int a[10005];
int main()
{
	cin>>t;
	while(t--)
	{
		int num=0,sum=0;
	    cin>>n>>x;
		 for(int i=1;i<=n;i++)
		       {cin>>a[i];
		         if(a[i]%2==1) num++;
		         else sum++;
			   }
			   k=0;
		 for(int i=0;i<=sum;i++)
		 { for(int j=1;j<=num;j=j+2)
		  {
		  	if(i+j==x) {cout<<"YES"<<endl;k=1;break;}

		  }
		  if(k==1) break;
		  }
	      if(k==0)  cout<<"NO"<<endl;
  }
	return 0;
}


#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <string>
#include <cmath>
#define LL long long
#define PI 3.141592653589
using namespace std;
LL t,n,m,x,k;
int a[10005];
int main()
{
	cin>>t;
	while(t--)
	{
		int num=0,sum=0;
	    cin>>n>>x;
		 for(int i=1;i<=n;i++)
		       {cin>>a[i];
		         if(a[i]%2==1) num++;
		         else sum++;
			   }
			   k=0;
		 for(int i=0;i<=sum;i++)
		  for(int j=1;j<=num;j+=2)
		  {
		  	if(i+j==x) {cout<<"YES"<<endl;k=1;break;}

		  }
	      if(k==0)  cout<<"NO"<<endl;
  }
	return 0;
}


#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <string>
#include <cmath>
#define LL long long
#define PI 3.141592653589
using namespace std;
LL t,n,m,x,k;
int a[10005];
int main()
{
	cin>>t;
	while(t--)
	{
		int num=0,sum=0;
	    cin>>n>>x;
		 for(int i=1;i<=n;i++)
		       {cin>>a[i];
		         if(a[i]%2==1) num++;
		         else sum++;
			   }
			   k=0;
		 for(int i=1;i<=sum;i++)
		  for(int j=1;j<=num;j+=2)
		  {
		  	if(i+j==x) {cout<<"YES"<<endl;break;k=1;}

		  }
	    if(!k) cout<<"NO"<<endl;
  }
	return 0;
}


#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <string>
#include <cmath>
#define LL long long
#define PI 3.141592653589
using namespace std;
LL t,n,m,x,k;
int a[10005];
int main()
{
	cin>>t;
	while(t--)
	{
		int num=0,sum=0;
	    cin>>n>>x;
		 for(int i=1;i<=n;i++)
		       {cin>>a[i];
		         if(a[i]%2==1) num++;
		         else sum++;
			   }
			   k=0;
		 for(int i=1;i<=sum;i++)
		  for(int j=1;j<=num;j+=2)
		  {
		  	if(i+j==x) {cout<<"YES"<<endl;break;k=1;}

		  }
	    if(k) cout<<"NO"<<endl;
  }
	return 0;
}


#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <string>
#include <cmath>
#define LL long long
#define PI 3.141592653589
using namespace std;
LL t,n,m,x,k;
int a;
int main()
{
	cin>>t;
	while(t--)
	{
		int num=0,sum=0;
	    cin>>n>>x;
		 for(int i=1;i<=n;i++)
		 {
		       cin>>a;
		       if(a%2==0) sum++;
		       else num++;
	    }
	    if(sum>=x&&num) cout<<"YES"<<endl;
	    else if(sum<x&&(x-sum)>=num&&(x-sum)%2==1) cout<<"YES"<<endl;
	    else if(sum<x&&(x-sum)>num&&(x-sum)%2==0) cout<<"YES"<<endl;
	    else if(num>=x&&x%2==1) cout<<"YES"<<endl;
	    else if(num<x&&num%2==1&&(x-num)>=sum) cout<<"YES"<<endl;
	    else cout<<"NO"<<endl;
  }
	return 0;
}


#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <string>
#include <cmath>
#define LL long long
#define PI 3.141592653589
using namespace std;
LL t,n,m,x,k;
int a[10005];
int main()
{
	cin>>t;
	while(t--)
	{
		int num=0,sum=0;
	    cin>>n>>x;
		 for(int i=1;i<=n;i++)
		       {cin>>a[i];
		         if(a[i]%2==1) num++;
		         else sum++;
			   }
		 if(x==n) {
		 	if(num%2==1) cout<<"YES"<<endl;
		 	else cout<<"NO"<<endl;
		 }
		 else if(x%2==1)
		 {
		 	if(x>=num&&num%2==1) cout<<"YES"<<endl;
		 	else if(x<num) cout<<"YES"<<endl;
		 	else cout<<"NO"<<endl;
		 }
		 else {
		 	if(num) cout<<"YES"<<endl;
		 	else cout<<"NO"<<endl;
		 }

  }
	return 0;
}


#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <string>
#include <cmath>
#define LL long long
#define PI 3.141592653589
using namespace std;
LL t,n,m,x,k;
int a[10005];
int main()
{
	cin>>t;
	while(t--)
	{
		int num=0,sum=0;
	    cin>>n>>x;
		 for(int i=1;i<=n;i++)
		       {cin>>a[i];
		         if(a[i]%2==1) num++;
		         else sum++;
			   }
		 if(x==n) {
		 	if(num%2==0) cout<<"NO"<<endl;
		 	else cout<<"YES"<<endl;
		 }
		 else if(x%2==1)
		 {
		 	if(num>0) cout<<"YES"<<endl;
		 	else cout<<"NO"<<endl;
		 }
		 else {
		 	if(sum==0) cout<<"NO"<<endl;
		 	else cout<<"YES"<<endl;
		 }

  }
	return 0;
}


#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <string>
#include <cmath>
#define LL long long
#define PI 3.141592653589
using namespace std;
LL t,n,m,x,k;
int a;
int main()
{
	cin>>t;
	while(t--)
	{
		int num=0,sum=0;
	    cin>>n>>x;
		 for(int i=1;i<=n;i++)
		 {
		       cin>>a;
		       if(a%2==0) sum++;
		       else num++;
	    }
	    if(x%2==0){
	    	if(num>=x) cout<<"NO"<<endl;
	    	else if(x>num&&num%2==1&&(x-num)>=sum) cout<<"YES"<<endl;
	    	else if(sum>=x-1&&num>0) cout<<"YES"<<endl;
	    	else if(sum<x-1&&num>=(x-sum)&&(x-sum)%2==1) cout<<"YES"<<endl;
			else cout<<"NO"<<endl;
		}
		else {
			if(num>=x) cout<<"YES"<<endl;
			else if(x>num&&num%2==1&&(x-num)>=sum) cout<<"YES"<<endl;
			else if(sum>=x-1&&num>0) cout<<"YES"<<endl;
	    	else if(sum<x-1&&num>=(x-sum)&&(x-sum)%2==1) cout<<"YES"<<endl;
			else cout<<"NO"<<endl;
		}
  }
	return 0;
}


#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <string>
#include <cmath>
#define LL long long
#define PI 3.141592653589
using namespace std;
LL t,n,m,x,k;
int a[10005];
int main()
{
	cin>>t;
	while(t--)
	{
		int num=0,sum=0,num1=0;
	    cin>>n>>x;
		 for(int i=1;i<=n;i++)
		       cin>>a[i];
		    sort(a+1,a+n+1);
		for(int i=1;i<=n;i++){
			if(a[i]%2==1&&a[i]!=a[i+1]) num++;
			else if(a[i]%2==1&&a[i]==a[i+1]) num1++;
			else sum++;
		}
	    if(sum>=x&&num) cout<<"YES"<< endl;
	    else if(sum<x&&(x-sum)>=num&&(x-sum)%2==1) cout<<"YES"<<endl;
	    else if(sum<x&&(x-sum)>num&&(x-sum)%2==0) cout<<"YES"<<endl;
	    else if(num>=x&&x%2==1) cout<<"YES"<<endl;
	    else if(num<x&&num%2==1&&(x-num)>=sum) cout<<"YES"<<endl;
	    else cout<<"NO"<<endl;
  }
	return 0;
}


#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <string>
#include <cmath>
#define LL long long
#define PI 3.141592653589
using namespace std;
LL t,n,m,x,k;
int a[10005];
int main()
{
	cin>>t;
	while(t--)
	{
		int num=0,sum=0;
	    cin>>n>>x;
		 for(int i=1;i<=n;i++)
		       {cin>>a[i];
		         if(a[i]%2==1) num++;
		         else sum++;
			   }
		 if(x==n) {
		 	if(num%2==1) cout<<"YES"<<endl;
		 	else cout<<"NO"<<endl;
		 }
		 else if(x%2==1)
		 {
		 	if(num) cout<<"YES"<<endl;
		 	else cout<<"NO"<<endl;
		 }
		 else {
		 	if(sum) cout<<"YES"<<endl;
		 	else cout<<"NO"<<endl;
		 }

  }
	return 0;
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long int t,n,k,i,odd,even,sum,sum1,sum2;
    cin>>t;
    while(t--)
    {
        odd=0,even=0,sum=0,sum1=0,sum2=0;
        cin>>n>>k;
        long long int a[n];
        for(i=0;i<n;i++)
        {
            cin>>a[i];
            sum+=a[i];
            if(a[i]%2)
                odd++,sum1+=a[i];
            else
                even++,sum2+=a[i];
        }
        if(even==0 && odd==n && n>=2 && k>=2 && k==n)
            cout<<"NO"<<endl;

        else if(odd==0 || (k==n && sum%2==0))
            cout<<"NO"<<endl;
        else if(odd%2==0 && even%2==0 && n==k)
            cout<<"NO"<<endl;
        else
            cout<<"YES"<<endl;
    }
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long int t,n,k,i,odd,even,sum,sum1,sum2;
    cin>>t;
    while(t--)
    {
        odd=0,even=0,sum=0,sum1=0,sum2=0;
        cin>>n>>k;
        long long int a[n];
        for(i=0;i<n;i++)
        {
            cin>>a[i];
            sum+=a[i];
            if(a[i]%2)
                odd++,sum1+=a[i];
            else
                even++,sum2+=a[i];
        }

        if(sum1%2==0 || sum1==0)
            cout<<"NO"<<endl;
        else
            cout<<"YES"<<endl;
    }
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long int t,n,k,i,odd,even,sum,sum1,sum2;
    cin>>t;
    while(t--)
    {
        odd=0,even=0,sum=0,sum1=0,sum2=0;
        cin>>n>>k;
        long long int a[n];
        for(i=0;i<n;i++)
        {
            cin>>a[i];
            sum+=a[i];
            if(a[i]%2)
                odd++,sum1+=a[i];
            else
                even++,sum2+=a[i];
        }

        if((odd==0 || (k==n && sum%2==0)) && (k%2 && n%2))
            cout<<"NO"<<endl;
        else
            cout<<"YES"<<endl;
    }
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long int t,n,k,i,odd,even;
    cin>>t;
    while(t--)
    {
        odd=0,even=0;
        cin>>n>>k;
        long long int a[n];
        for(i=01;i<n;i++)
        {
            cin>>a[i];
            if(a[i]%2)
             odd++;
             else
                even++;
        }
        if(odd==0 || (even==0 && k%2==0) || (odd%2==0 && k==n))
            cout<<"NO"<<endl;
        else
            cout<<"YES"<<endl;
    }
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long int t,n,k,i,odd,even,sum,sum1,sum2;
    cin>>t;
    while(t--)
    {
        odd=0,even=0,sum=0,sum1=0,sum2=0;
        cin>>n>>k;
        long long int a[n];
        for(i=0;i<n;i++)
        {
            cin>>a[i];
            sum+=a[i];
            if(a[i]%2)
                odd++,sum1+=a[i];
            else
                even++,sum2+=a[i];
        }
        if(k%2 && k==n && sum1%2)
            cout<<"YES"<<endl;
        else if(k%2 && sum1%2)
            cout<<"YES"<<endl;
        else if(k==n && sum%2)
            cout<<"YES"<<endl;
        else
            cout<<"NO"<<endl;

    }
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long int t,n,k,i,odd,even,sum,sum1,sum2;
    cin>>t;
    while(t--)
    {
        odd=0,even=0,sum=0,sum1=0,sum2=0;
        cin>>n>>k;
        long long int a[n];
        for(i=0;i<n;i++)
        {
            cin>>a[i];
            sum+=a[i];
            if(a[i]%2)
                odd++,sum1+=a[i];
            else
                even++,sum2+=a[i];
        }

        if((odd==0 || (k==n && sum%2==0 && even==0)) && (k%2 && n%2 &&(k-n)%2==0))
            cout<<"NO"<<endl;
        else
            cout<<"YES"<<endl;
    }
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long int t,n,k,i,odd,even,sum,sum1,sum2;
    cin>>t;
    while(t--)
    {
        odd=0,even=0,sum=0,sum1=0,sum2=0;
        cin>>n>>k;
        long long int a[n];
        for(i=0;i<n;i++)
        {
            cin>>a[i];
            sum+=a[i];
            if(a[i]%2)
                odd++,sum1+=a[i];
            else
                even++,sum2+=a[i];
        }

        if((sum1%2==0 || sum1==0) && even%2)
            cout<<"NO"<<endl;
        else
            cout<<"YES"<<endl;
    }
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long int t,n,k,i,odd,even,sum,sum1,sum2;
    cin>>t;
    while(t--)
    {
        odd=0,even=0,sum=0,sum1=0,sum2=0;
        cin>>n>>k;
        long long int a[n];
        for(i=0;i<n;i++)
        {
            cin>>a[i];
            sum+=a[i];
            if(a[i]%2)
                odd++,sum1+=a[i];
            else
                even++,sum2+=a[i];
        }

        if((odd==0 || (k==n && sum%2==0)) && (k%2 && n%2 &&(k-n)%2==0))
            cout<<"NO"<<endl;
        else
            cout<<"YES"<<endl;
    }
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long int t,n,k,i,odd,even,sum,sum1,sum2;
    cin>>t;
    while(t--)
    {
        odd=0,even=0,sum=0,sum1=0,sum2=0;
        cin>>n>>k;
        long long int a[n];
        for(i=0;i<n;i++)
        {
            cin>>a[i];
            sum+=a[i];
            if(a[i]%2)
                odd++,sum1+=a[i];
            else
                even++,sum2+=a[i];
        }

        if((odd==0 || even==0) || (k==n && sum%2==0))
            cout<<"NO"<<endl;
        else
            cout<<"YES"<<endl;
    }
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long int t,n,k,i,odd,even,sum,sum1,sum2;
    cin>>t;
    while(t--)
    {
        odd=0,even=0,sum=0,sum1=0,sum2=0;
        cin>>n>>k;
        long long int a[n];
        for(i=0;i<n;i++)
        {
            cin>>a[i];
            sum+=a[i];
            if(a[i]%2)
                odd++,sum1+=a[i];
            else
                even++,sum2+=a[i];
        }

        if((sum1%2==0 || sum1==0) && odd%2==0)
            cout<<"NO"<<endl;
        else
            cout<<"YES"<<endl;
    }
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long int t,n,k,i,odd,even,sum,sum1,sum2;
    cin>>t;
    while(t--)
    {
        odd=0,even=0,sum=0,sum1=0,sum2=0;
        cin>>n>>k;
        long long int a[n];
        for(i=0;i<n;i++)
        {
            cin>>a[i];
            sum+=a[i];
            if(a[i]%2)
                odd++,sum1+=a[i];
            else
                even++,sum2+=a[i];
        }
        if(even==0 && odd==n && n>=2 && k>=2 && k==n)
            cout<<"NO"<<endl;

        else if(odd==0 || (k==n && sum%2==0))
            cout<<"NO"<<endl;
        else if(odd==n && k%2==0)
            cout<<"NO"<<endl;
        else
            cout<<"YES"<<endl;
    }
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long int t,n,k,i,odd,even,sum,sum1,sum2;
    cin>>t;
    while(t--)
    {
        odd=0,even=0,sum=0,sum1=0,sum2=0;
        cin>>n>>k;
        long long int a[n];
        for(i=0;i<n;i++)
        {
            cin>>a[i];
            sum+=a[i];
            if(a[i]%2)
                odd++,sum1+=a[i];
            else
                even++,sum2+=a[i];
        }

        if(k%2 && even%2)
            cout<<"NO"<<endl;
        else
            cout<<"YES"<<endl;
    }
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long int t,n,k,i,odd,even,sum,sum1,sum2;
    cin>>t;
    while(t--)
    {
        odd=0,even=0,sum=0,sum1=0,sum2=0;
        cin>>n>>k;
        long long int a[n];
        for(i=0;i<n;i++)
        {
            cin>>a[i];
            sum+=a[i];
            if(a[i]%2)
                odd++,sum1+=a[i];
            else
                even++,sum2+=a[i];
        }

        if(odd=0 || (k==n && sum%2==0))
            cout<<"NO"<<endl;
        else
            cout<<"YES"<<endl;
    }
}


//----->|try=0; while(!success) try++;|<------
//----->|Belief Yourself,Respect Yourself|<----
//----->|Be Proud Of Yourself,You're Doing Your best|<-----
#include<bits/stdc++.h>
using namespace std;
#define uniq(x)  x.erase(unique(x.begin(),x.end()), x.end()) //Unique value find from vector
#define upper(arr,n,fixed) upper_bound(arr,arr+n,fixed)-arr  //Upper value search;
#define lower(arr,n,fixed) upper_bound(arr,arr+n,fixed)-arr  //Lower value search;
#define max3(a,b,c) max(max(a,b),c)//maximum value find three value;
#define min3(a,b,c) min(min(a,b),c)//minimum value find three value;
#define PI acos(-1.0)//PI Calculation
#define LL long long
#define AND(a,b) ((a) & (b))
#define OR(a,b) ((a)|(b))
#define XOR(a,b) ((a) ^ (b))
#define mp make_pair
#define sqr(x) ((x)*(x))
#define sqrt(x) sqrt(1.0*(x))
#define INF_MAX 2147483647
#define INF_MIN -2147483647
#define MX 1000005
#define MOD 1000000007
template<typename T> T POW(T b,T p)          //Pow calculation
{
    T r=1;
    while(p)
    {
        if(p&1)r=(r*b);
        b=(b*b);
        p>>=1;
    }
    return r;
}

template<typename T> T BigMod(T b,T p,T m) //BigMod Calculation
{
    T r=1;
    while(p)
    {
        if(p&1)r=(r*b)%m;
        b=(b*b)%m;
        p>>=1;
    }
    return r;
}

//||--------------------------->||Main_Code_Start_Here||<---------------------------------||
int main()
{
    //freopen("a.in", "r", stdin);
    //freopen("a.out", "w", stdout);
    int n,p,q;
    string s,ss;
    while(cin>>n>>p>>q)
    {
        cin>>s;
        ss="";
        for(int i=0; i<n; i++)
        {
            ss+=s[i];
        }

        int flag=0;
        int a,b;
        for(a=0; a<n; a++)
        {
            for(b=0; b<n; b++)
            {
                if(a*p+b*q==n)
                {
                    //keep=a+b;
                    flag=1;
                    break;
                }
            }
            if(flag) break;
        }
        if(!flag)
        {
            cout<<"-1"<<endl;
            continue;
        }
        int k,t=0;
        //cout<<"a = "<<a<<endl;
        //cout<<"b = "<<b<<endl;
        if(n==1 && p==1 && q==1)
        {
            cout<<"-1"<<endl;
            continue;
        }
        cout<<a+b<<endl;
        for(k=0; k<n && a!=0; k++)
        {
            cout<<ss[k];
            t++;
            if(t==p)
            {
                t=0;
                cout<<endl;
                a--;
            }

        }

        int tt=0;
        for(k=k; k<n && b!=0; k++)
        {
            cout<<ss[k];
            tt++;
            if(tt==q)
            {
                tt=0;
                cout<<endl;
                b--;
            }

        }

    }
}


//----->|try=0; while(!success) try++;|<------
//----->|Belief Yourself,Respect Yourself|<----
//----->|Be Proud Of Yourself,You're Doing Your best|<-----
#include<bits/stdc++.h>
using namespace std;
#define uniq(x)  x.erase(unique(x.begin(),x.end()), x.end()) //Unique value find from vector
#define upper(arr,n,fixed) upper_bound(arr,arr+n,fixed)-arr  //Upper value search;
#define lower(arr,n,fixed) upper_bound(arr,arr+n,fixed)-arr  //Lower value search;
#define max3(a,b,c) max(max(a,b),c)//maximum value find three value;
#define min3(a,b,c) min(min(a,b),c)//minimum value find three value;
#define PI acos(-1.0)//PI Calculation
#define LL long long
#define AND(a,b) ((a) & (b))
#define OR(a,b) ((a)|(b))
#define XOR(a,b) ((a) ^ (b))
#define mp make_pair
#define sqr(x) ((x)*(x))
#define sqrt(x) sqrt(1.0*(x))
#define INF_MAX 2147483647
#define INF_MIN -2147483647
#define MX 1000005
#define MOD 1000000007
template<typename T> T POW(T b,T p)          //Pow calculation
{
    T r=1;
    while(p)
    {
        if(p&1)r=(r*b);
        b=(b*b);
        p>>=1;
    }
    return r;
}

template<typename T> T BigMod(T b,T p,T m) //BigMod Calculation
{
    T r=1;
    while(p)
    {
        if(p&1)r=(r*b)%m;
        b=(b*b)%m;
        p>>=1;
    }
    return r;
}

//||--------------------------->||Main_Code_Start_Here||<---------------------------------||
int main()
{
    //freopen("a.in", "r", stdin);
    //freopen("a.out", "w", stdout);
    int n,p,q;
    string s;
    while(cin>>n>>p>>q)
    {
        cin>>s;
        string ss="";
        for(int i=0; i<n; i++)
        {
            ss+=s[i];
        }
        if(p<q)
        {
            int temp=q;
            q=p;
            p=temp;

        }

        if(n%q==0)
        {
            cout<<n/q<<endl;
            int j=0;
            for(int i=0; i<n; i++)
            {

                cout<<ss[i];
                j++;
                if(j==q)
                {
                    cout<<endl;
                    j=0;
                }

            }
        }
        else if(2*q>n) cout<<"-1"<<endl;
        else if(n%p==0)
        {
            cout<<n/p<<endl;
            int j=0;
            for(int i=0; i<n; i++)
            {

                cout<<ss[i];
                j++;
                if(j==p)
                {
                    cout<<endl;
                    j=0;
                }

            }
        }
        else
        {
            int j=0;
            cout<<2*(n/(p+q))<<endl;
            int flag=0;
            for(int i=0;i<n;i++)
            {
                cout<<ss[i];
                j++;
                if(j==p && flag==0)
                {
                    j=0;
                    flag=1;
                    cout<<endl;
                }
                else if(j==q && flag)
                {
                    j=0;
                    flag=0;
                    cout<<endl;
                }
            }
        }
    }
}


//----->|try=0; while(!success) try++;|<------
//----->|Belief Yourself,Respect Yourself|<----
//----->|Be Proud Of Yourself,You're Doing Your best|<-----
#include<bits/stdc++.h>
using namespace std;
#define uniq(x)  x.erase(unique(x.begin(),x.end()), x.end()) //Unique value find from vector
#define upper(arr,n,fixed) upper_bound(arr,arr+n,fixed)-arr  //Upper value search;
#define lower(arr,n,fixed) upper_bound(arr,arr+n,fixed)-arr  //Lower value search;
#define max3(a,b,c) max(max(a,b),c)//maximum value find three value;
#define min3(a,b,c) min(min(a,b),c)//minimum value find three value;
#define PI acos(-1.0)//PI Calculation
#define LL long long
#define AND(a,b) ((a) & (b))
#define OR(a,b) ((a)|(b))
#define XOR(a,b) ((a) ^ (b))
#define mp make_pair
#define sqr(x) ((x)*(x))
#define sqrt(x) sqrt(1.0*(x))
#define INF_MAX 2147483647
#define INF_MIN -2147483647
#define MX 1000005
#define MOD 1000000007
template<typename T> T POW(T b,T p)          //Pow calculation
{
    T r=1;
    while(p)
    {
        if(p&1)r=(r*b);
        b=(b*b);
        p>>=1;
    }
    return r;
}

template<typename T> T BigMod(T b,T p,T m) //BigMod Calculation
{
    T r=1;
    while(p)
    {
        if(p&1)r=(r*b)%m;
        b=(b*b)%m;
        p>>=1;
    }
    return r;
}

//||--------------------------->||Main_Code_Start_Here||<---------------------------------||
int main()
{
    //freopen("a.in", "r", stdin);
    //freopen("a.out", "w", stdout);
    int n,p,q;
    string s,ss;
    while(cin>>n>>p>>q)
    {
        cin>>s;
        ss="";
        for(int i=0; i<n; i++)
        {
            ss+=s[i];
        }

        int flag=0;
        int a,b;
        for(a=0; a<n; a++)
        {
            for(b=0; b<n; b++)
            {
                if(a*p+b*q==n)
                {
                    //keep=a+b;
                    flag=1;
                    break;
                }
            }
            if(flag) break;
        }
        if(!flag)
        {
            cout<<"-1"<<endl;
            continue;
        }
        int k,t=0;
        //cout<<"a = "<<a<<endl;
        //cout<<"b = "<<b<<endl;
        cout<<a+b<<endl;
        for(k=0; k<n && a!=0; k++)
        {
            cout<<ss[k];
            t++;
            if(t==p)
            {
                t=0;
                cout<<endl;
                a--;
            }

        }

        int tt=0;
        for(k=k; k<n && b!=0; k++)
        {
            cout<<ss[k];
            tt++;
            if(tt==q)
            {
                tt=0;
                cout<<endl;
                b--;
            }

        }

    }
}


#include <iostream>
#include <string>
using namespace std;

int main()
{
    long long num, one, two, i, j, z = 0;
    bool stop = 0;
    char word[1000];
    cin >> num >> one >> two;
    for (int i = 0; i<num; i++)
    {
        cin >> word[i];
    }
    if (one + two == num)
    {
        cout << 2 << endl;
        for (int i = 0; i<one; i++)
        {
            cout << word[i];
        }
        cout << endl;
        for (int i = one; i<num; i++)
        {
            cout << word[i];
        }
    }
    else if (one+two<num)
    {
        if (one >= two)
        {
            for (i = 0; i <= num; i++)
            {
                for (j = 0; i <= num; j++)
                {
                    if ((i*two) + (j*one) == num)
                    {
                        stop = 1;
                        break;
                    }
                    if ((i*two) + (j*one) > num)
                    {

                        break;
                    }
                }
                if (stop == 1)
                {
                    break;
                }

            }
            if (stop == 1)
            {
                cout << i + j << endl;

                for (int a = 1; a <= j; a++)
                {
                    for (int q = z; z<a*one; z++)
                    {
                        cout << word[z];
                    }
                    cout << endl;
                    z = (a*one);
                }
                z = 0;
                for (int a = 1; a <= i; a++)
                {
                    for (int q = z; z<a*two; z++)
                    {
                        cout << word[z];
                    }
                    cout << endl;
                    z = (a*two);
                }
            }
            else if(stop==0)
            {
                cout << -1;
            }

        }
        else
        {
            for (i = 0; i <= num; i++)
            {
                for (j = 0; i <= num; j++)
                {
                    if ((j*two) + (i*one) == num)
                    {
                        stop = 1;
                        break;
                    }
                    if ((j*two) + (i*one) > num)
                    {

                        break;
                    }
                }
                if (stop == 1)
                {
                    break;
                }
            }
            if (stop == 1)
            {
                cout << i + j << endl;
                z = 0;
                for (int a = 1; a <= i; a++)
                {
                    for (int q = z; z<a*one; z++)
                    {
                        cout << word[z];
                    }
                    cout << endl;
                    z = (j*one);
                }
                z = 0;
                for (int a = 1; a <= j; a++)
                {
                    for (int q = z; z<a*two; z++)
                    {
                        cout << word[z];
                    }
                    cout << endl;
                    z = (i*two);
                }
            }
            else if(stop==0)
            {
                cout << -1;
            }
        }
    }
    else if (one + two>num)
    {
        if (one >= two)
        {
            for (i = 0; i <= num; i++)
            {
                for (j = 0; i <= num; j++)
                {
                    if ((j*two) + (i*one) == num)
                    {
                        stop = 1;
                        break;
                    }
                    if ((j*two) + (i*one) > num)
                    {

                        break;
                    }
                }
                if (stop == 1)
                {
                    break;
                }

            }
            if (stop == 1)
            {
                cout << i + j << endl;

                for (int a = 1; a <= i; a++)
                {
                    for (int q = z; z<a*one; z++)
                    {
                        cout << word[z];
                    }
                    cout << endl;
                    z = (a*one);
                }
                z = 0;
                for (int a = 1; a <= j; a++)
                {
                    for (int q = z; z<a*two; z++)
                    {
                        cout << word[z];
                    }
                    cout << endl;
                    z = (a*two);
                }
            }
            else
            {
                cout << -1;
            }

        }
        else
        {
            for (i = 0; i <= num; i++)
            {
                for (j = 0; i <= num; j++)
                {
                    if ((i*two) + (j*one) == num)
                    {
                        stop = 1;
                        break;
                    }
                    if ((i*two) + (j*one) > num)
                    {

                        break;
                    }
                }
                if (stop == 1)
                {
                    break;
                }
            }
            if (stop == 1)
            {
                cout << i + j << endl;
                z = 0;
                for (int a = 1; a <= j; a++)
                {
                    for (int q = z; z<j*one; z++)
                    {
                        cout << word[z];
                    }
                    cout << endl;
                    z = (j*one);
                }
                z = 0;
                for (int a = 1; a <= i; a++)
                {
                    for (int q = z; z<i*two; z++)
                    {
                        cout << word[z];
                    }
                    cout << endl;
                    z = (i*two);
                }
            }
            else
            {
                cout << -1;
            }
        }
    }
    return 0;
}


#include <iostream>
#include <string>
using namespace std;

int main()
{
    long long num, one, two, i, j, z = 0;
    bool stop = 0;
    char word[1000];
    cin >> num >> one >> two;
    for (int i = 0; i < num; i++)
    {
        cin >> word[i];
    }
    if (one + two == num)
    {
        cout << 2 << endl;
        for (int i = 0; i < one; i++)
        {
            cout << word[i];
        }
        cout << endl;
        for (int i = one; i < num; i++)
        {
            cout << word[i];
        }
    }
    else if (one + two<num)
    {
        if (one >= two)
        {
            for (i = 0; i <= num; i++)
            {
                for (j = 0; j <= num; j++)
                {
                    if ((i*one) + (j*two) == num)
                    {
                        break;
                    }
                    if ((i*one) + (j*two) > num)
                    {
                        break;
                    }
                }
            }
            if (j == num) {
                for (i = 0; i <= num; i++)
                {
                    if ((i*two) == num)
                    {
                        stop = 1;
                        break;
                    }
                    if ((i*two) > num)
                    {

                        break;
                    }
                }

                if (stop == 1)
                {
                    cout << i << endl;

                    z = 0;
                    for (int a = 1; a <= i; a++)
                    {
                        for (int q = z; z < a*two; z++)
                        {
                            cout << word[z];
                        }
                        cout << endl;
                        z = (a*two);
                    }
                }
                else if (stop == 0)
                {
                    cout << -1;
                }
            }
            else
            {
                for (i = 0; i <= num; i++)
                {
                    for (j = 0; j <= num; j++)
                    {
                        if ((j*two) + (i*one) == num)
                        {
                            stop = 1;
                            break;
                        }
                        if ((j*two) + (i*one) > num)
                        {

                            break;
                        }
                    }
                    if (stop == 1)
                    {
                        break;
                    }

                }
                if (stop == 1)
                {
                    cout << i + j << endl;

                    for (int a = 1; a <= i; a++)
                    {
                        for (int q = z; z<a*one; z++)
                        {
                            cout << word[z];
                        }
                        cout << endl;
                        z = (a*one);
                    }
                    z = 0;
                    for (int a = 1; a <= j; a++)
                    {
                        for (int q = z; z<a*two; z++)
                        {
                            cout << word[z];
                        }
                        cout << endl;
                        z = (a*two);
                    }
                }
                else if (stop == 0)
                {
                    cout << -1;
                }

            }
        }
        else
        {
            for (i = 0; i <= num; i++)
            {
                for (j = 0; j <= num; j++)
                {
                    if ((j*one) + (i*two) == num)
                    {
                        break;
                    }
                    if ((j*one) + (i*two) > num)
                    {
                        break;
                    }
                }
            }
            if (j == num)
            {
                for (i = 0; i <= num; i++)
                {
                    if ((i*one) == num)
                    {
                        stop = 1;
                        break;
                    }
                    if ((i*one) > num)
                    {

                        break;
                    }
                }

                if (stop == 1)
                {
                    cout << i << endl;
                    z = 0;
                    for (int a = 1; a <= i; a++)
                    {
                        for (int q = z; z < a*one; z++)
                        {
                            cout << word[z];
                        }
                        cout << endl;
                        z = (a*one);
                    }
                }
                else if (stop == 0)
                {
                    cout << -1;
                }
            }
            else
            {
                for (i = 0; i <= num; i++)
                {
                    for (j = 0; i <= num; j++)
                    {
                        if ((i*two) + (j*one) == num)
                        {
                            stop = 1;
                            break;
                        }
                        if ((i*two) + (j*one) > num)
                        {

                            break;
                        }
                    }
                    if (stop == 1)
                    {
                        break;
                    }
                }
                if (stop == 1)
                {
                    cout << i + j << endl;
                    z = 0;
                    for (int a = 1; a <= j; a++)
                    {
                        for (int q = z; z<a*one; z++)
                        {
                            cout << word[z];
                        }
                        cout << endl;
                        z = (a*one);
                    }
                    z = 0;
                    for (int a = 1; a <= i; a++)
                    {
                        for (int q = z; z<a*two; z++)
                        {
                            cout << word[z];
                        }
                        cout << endl;
                        z = (a*two);
                    }
                }
                else if (stop == 0)
                {
                    cout << -1;
                }
            }
            }

    }
    else if (one + two>num)
    {
        if (one <= two)
        {
            for (i = 0; i <= num; i++)
            {
                for (j = 0; j <= num; j++)
                {
                    if ((j*one) + (i*two) == num)
                    {
                        break;
                    }
                    if ((j*one) + (i*two) > num)
                    {
                        break;
                    }
                }
            }
            if (j == num)
            {
                for (i = 0; i <= num; i++)
                {

                    if ((i*one) == num)
                    {
                        stop = 1;
                        break;
                    }
                    if ((i*one) > num)
                    {

                        break;
                    }

                }
                if (stop == 1)
                {
                    cout << i << endl;

                    for (int a = 1; a <= i; a++)
                    {
                        for (int q = z; z < a*one; z++)
                        {
                            cout << word[z];
                        }
                        cout << endl;
                        z = (a*one);
                    }
                }
                else
                {
                    cout << -1;
                }

            }
            else
            {
                for (i = 0; i <= num; i++)
                {
                    for (j = 0; i <= num; j++)
                    {
                        if ((i*two) + (j*one) == num)
                        {
                            stop = 1;
                            break;
                        }
                        if ((i*two) + (j*one) > num)
                        {

                            break;
                        }
                    }
                    if (stop == 1)
                    {
                        break;
                    }
                }
                if (stop == 1)
                {
                    cout << i + j << endl;
                    z = 0;
                    for (int a = 1; a <= j; a++)
                    {
                        for (int q = z; z<a*one; z++)
                        {
                            cout << word[z];
                        }
                        cout << endl;
                        z = (a*one);
                    }
                    z = 0;
                    for (int a = 1; a <= i; a++)
                    {
                        for (int q = z; z<a*two; z++)
                        {
                            cout << word[z];
                        }
                        cout << endl;
                        z = (a*two);
                    }
                }
                else
                {
                    cout << -1;
                }
            }
        }
        else
        {
            for (i = 0; i <= num; i++)
            {
                for (j = 0; j <= num; j++)
                {
                    if ((i*one) + (j*two) == num)
                    {
                        break;
                    }
                    if ((i*one) + (j*two) > num)
                    {
                        break;
                    }
                }
            }
            if (j == num)
            {
                for (i = 0; i <= num; i++)
                {

                    if ((i*two) == num)
                    {
                        stop = 1;
                        break;
                    }
                    if ((i*two) > num)
                    {

                        break;
                    }
                }
                if (stop == 1)
                {
                    cout << i << endl;
                    z = 0;
                    for (int a = 1; a <= i; a++)
                    {
                        for (int q = z; z < a*two; z++)
                        {
                            cout << word[z];
                        }
                        cout << endl;
                        z = (a*two);
                    }
                }
                else
                {
                    cout << -1;
                }
            }
            else
            {
                for (i = 0; i <= num; i++)
                {
                    for (j = 0; i <= num; j++)
                    {
                        if ((j*two) + (i*one) == num)
                        {
                            stop = 1;
                            break;
                        }
                        if ((j*two) + (i*one) > num)
                        {

                            break;
                        }
                    }
                    if (stop == 1)
                    {
                        break;
                    }

                }
                if (stop == 1)
                {
                    cout << i + j << endl;

                    for (int a = 1; a <= i; a++)
                    {
                        for (int q = z; z<a*one; z++)
                        {
                            cout << word[z];
                        }
                        cout << endl;
                        z = (a*one);
                    }
                    z = 0;
                    for (int a = 1; a <= j; a++)
                    {
                        for (int q = z; z<a*two; z++)
                        {
                            cout << word[z];
                        }
                        cout << endl;
                        z = (a*two);
                    }
                }
                else if (stop == 0)
                {
                    cout << -1;
                }

            }

        }
    }
    return 0;
}


#include <iostream>
#include <string>
using namespace std;

int main()
{
    //while(true)
    {
        long long num,one,two,i,j,coun=0;
        string kalam;
        bool stop = 0;
        cin >> num>>one>>two;
        cin >> kalam;
        if (num == one+two)
        {
            cout << 2 << endl;
            for (i = 0; i < one; i++)
            {
                cout << kalam[i];
            }
            cout << endl;
            for (i = one; i < num; i++)
            {
                cout << kalam[i];
            }
        }
        else
        {

            {
                for (i = 0; i <= num; i++)
                {
                    for (j = 0; j <= num; j++)
                    {
                        if ((i*one) + (j*two) == num)
                        {
                            stop = 1;
                            break;
                        }
                        if ((i*one) + (j*two) > num)
                        {
                            break;
                        }
                    }
                    if (stop == 1)
                    {
                        break;
                    }
                }
                if (stop == 1)
                {
                    cout << i + j << endl;
                    if (i != 0)
                    {
                        for (int m = 0; m < i*one; m++)
                        {
                            if (m%one == 0 && m != 0)
                            {
                                cout << endl;
                            }
                            cout << kalam[m];
                        }
                        cout << endl;
                    }
                    if (j != 0)
                    {
                        for (int m = i*one; m < num; m++)
                        {
                            if (coun == two)
                            {
                                cout << endl;
                                coun = 0;
                            }
                            cout << kalam[m];
                            coun++;
                        }
                    }
                }
                else
                {
                    cout << -1 << endl;
                }
            }

        }
    }
    return 0;
}


#include <iostream>
#include <string>
using namespace std;

int main()
{
    long long num, one, two, i, j, z = 0;
    bool stop = 0;
    char word[1000];
    cin >> num >> one >> two;
    for (int i = 0; i < num; i++)
    {
        cin >> word[i];
    }
    if (one + two == num)
    {
        cout << 2 << endl;
        for (int i = 0; i < one; i++)
        {
            cout << word[i];
        }
        cout << endl;
        for (int i = one; i < num; i++)
        {
            cout << word[i];
        }
    }
    else if (one + two<num)
    {
        if (one >= two)
        {
            for (i = 0; i <= num; i++)
            {
                if ((i*two) == num)
                {
                    stop = 1;
                    break;
                }
                if ((i*two) > num)
                {

                    break;
                }
            }

            if (stop == 1)
            {
                cout << i << endl;

                z = 0;
                for (int a = 1; a <= i; a++)
                {
                    for (int q = z; z < a*two; z++)
                    {
                        cout << word[z];
                    }
                    cout << endl;
                    z = (a*two);
                }
            }
            else if (stop == 0)
            {
                cout << -1;
            }
        }
        else
        {
            for (i = 0; i <= num; i++)
            {
                if ((i*one) == num)
                {
                    stop = 1;
                    break;
                }
                if ((i*one) > num)
                {

                    break;
                }
            }

            if (stop == 1)
            {
                cout << i << endl;
                z = 0;
                for (int a = 1; a <= i; a++)
                {
                    for (int q = z; z < a*one; z++)
                    {
                        cout << word[z];
                    }
                    cout << endl;
                    z = (a*one);
                }
            }
            else if (stop == 0)
            {
                cout << -1;
            }
        }
    }
    else if (one + two>num)
    {
        if (one <= two)
        {
            for (i = 0; i <= num; i++)
            {

                    if ( (i*one) == num)
                    {
                        stop = 1;
                        break;
                    }
                    if ((i*one) > num)
                    {

                        break;
                    }

            }
            if (stop == 1)
            {
                cout << i << endl;

                for (int a = 1; a <= i; a++)
                {
                    for (int q = z; z<a*one; z++)
                    {
                        cout << word[z];
                    }
                    cout << endl;
                    z = (a*one);
                }
            }
            else
            {
                cout << -1;
            }

        }
        else
        {
            for (i = 0; i <= num; i++)
            {

                    if ((i*two)  == num)
                    {
                        stop = 1;
                        break;
                    }
                    if ((i*two) > num)
                    {

                        break;
                    }
            }
            if (stop == 1)
            {
                cout << i << endl;
                z = 0;
                for (int a = 1; a <= i; a++)
                {
                    for (int q = z; z<i*two; z++)
                    {
                        cout << word[z];
                    }
                    cout << endl;
                    z = (i*two);
                }
            }
            else
            {
                cout << -1;
            }
        }
    }
    return 0;
}


#include <iostream>
#include <string>
using namespace std;

int main()
{
    long long num, one, two, i, j, z = 0;
    bool stop = 0;
    char word[1000];
    cin >> num >> one >> two;
    for (int i = 0; i<num; i++)
    {
        cin >> word[i];
    }
    if (one + two == num)
    {
        cout << 2 << endl;
        for (int i = 0; i<one; i++)
        {
            cout << word[i];
        }
        cout << endl;
        for (int i = one; i<num; i++)
        {
            cout << word[i];
        }
    }
    else if (one+two<num)
    {
        if (one >= two)
        {
            for (i = 0; i <= num; i++)
            {
                for (j = 0; i <= num; j++)
                {
                    if ((i*two) + (j*one) == num)
                    {
                        stop = 1;
                        break;
                    }
                    if ((i*two) + (j*one) > num)
                    {

                        break;
                    }
                }
                if (stop == 1)
                {
                    break;
                }

            }
            if (stop == 1)
            {
                cout << i + j << endl;

                for (int a = 1; a <= i; a++)
                {
                    for (int q = z; z<a*one; z++)
                    {
                        cout << word[z];
                    }
                    cout << endl;
                    z = (a*one);
                }
                z = 0;
                for (int a = 1; a <= j; a++)
                {
                    for (int q = z; z<a*two; z++)
                    {
                        cout << word[z];
                    }
                    cout << endl;
                    z = (a*two);
                }
            }
            else if(stop==0)
            {
                cout << -1;
            }

        }
        else
        {
            for (i = 0; i <= num; i++)
            {
                for (j = 0; i <= num; j++)
                {
                    if ((j*two) + (i*one) == num)
                    {
                        stop = 1;
                        break;
                    }
                    if ((j*two) + (i*one) > num)
                    {

                        break;
                    }
                }
                if (stop == 1)
                {
                    break;
                }
            }
            if (stop == 1)
            {
                cout << i + j << endl;
                z = 0;
                for (int a = 1; a <= j; a++)
                {
                    for (int q = z; z<j*one; z++)
                    {
                        cout << word[z];
                    }
                    cout << endl;
                    z = (j*one);
                }
                z = 0;
                for (int a = 1; a <= i; a++)
                {
                    for (int q = z; z<i*two; z++)
                    {
                        cout << word[z];
                    }
                    cout << endl;
                    z = (i*two);
                }
            }
            else if(stop==0)
            {
                cout << -1;
            }
        }
    }
    else if (one + two>num)
    {
        if (one >= two)
        {
            for (i = 0; i <= num; i++)
            {
                for (j = 0; i <= num; j++)
                {
                    if ((j*two) + (i*one) == num)
                    {
                        stop = 1;
                        break;
                    }
                    if ((j*two) + (i*one) > num)
                    {

                        break;
                    }
                }
                if (stop == 1)
                {
                    break;
                }

            }
            if (stop == 1)
            {
                cout << i + j << endl;

                for (int a = 1; a <= i; a++)
                {
                    for (int q = z; z<a*one; z++)
                    {
                        cout << word[z];
                    }
                    cout << endl;
                    z = (a*one);
                }
                z = 0;
                for (int a = 1; a <= j; a++)
                {
                    for (int q = z; z<a*two; z++)
                    {
                        cout << word[z];
                    }
                    cout << endl;
                    z = (a*two);
                }
            }
            else
            {
                cout << -1;
            }

        }
        else
        {
            for (i = 0; i <= num; i++)
            {
                for (j = 0; i <= num; j++)
                {
                    if ((i*two) + (j*one) == num)
                    {
                        stop = 1;
                        break;
                    }
                    if ((i*two) + (j*one) > num)
                    {

                        break;
                    }
                }
                if (stop == 1)
                {
                    break;
                }
            }
            if (stop == 1)
            {
                cout << i + j << endl;
                z = 0;
                for (int a = 1; a <= j; a++)
                {
                    for (int q = z; z<j*one; z++)
                    {
                        cout << word[z];
                    }
                    cout << endl;
                    z = (j*one);
                }
                z = 0;
                for (int a = 1; a <= i; a++)
                {
                    for (int q = z; z<i*two; z++)
                    {
                        cout << word[z];
                    }
                    cout << endl;
                    z = (i*two);
                }
            }
            else
            {
                cout << -1;
            }
        }
    }
    return 0;
}


#include <iostream>
#include <string>
using namespace std;

int main()
{
    //while(true)
    {
        long long num,one,two,i,j,coun=0;
        string kalam;
        bool stop = 0;
        cin >> num>>one>>two;
        cin >> kalam;
        if (num == one+two)
        {
            cout << 2 << endl;
            for (i = 0; i < one; i++)
            {
                cout << kalam[i];
            }
            cout << endl;
            for (i = one; i < num; i++)
            {
                cout << kalam[i];
            }
        }
        else
        {
            if (one >= two)
            {
                for (i = 0; i <= num; i++)
                {
                    for (j = 0; j <= num; j++)
                    {
                        if ((i*one) + (j*two) == num)
                        {
                            stop = 1;
                            break;
                        }
                        if ((i*one) + (j*two) > num)
                        {
                            break;
                        }
                    }
                    if (stop == 1)
                    {
                        break;
                    }
                }
                if (stop == 1)
                {
                    cout << i + j << endl;
                    if (i != 0)
                    {
                        for (int m = 0; m < i*one; m++)
                        {
                            if (m%one == 0 && m != 0)
                            {
                                cout << endl;
                            }
                            cout << kalam[m];
                        }
                        cout << endl;
                    }
                    if (j != 0)
                    {
                        for (int m = i*one; m < num; m++)
                        {
                            if (coun == two)
                            {
                                cout << endl;
                                coun = 0;
                            }
                            cout << kalam[m];
                            coun++;
                        }
                    }
                }
                else
                {
                    cout << -1 << endl;
                }
            }
            else
            {
                for (i = 0; i <= num; i++)
                {
                    for (j = 0; j <= num; j++)
                    {
                        if ((j*one) + (i*two) == num)
                        {
                            stop = 1;
                            break;
                        }
                        if ((j*one) + (i*two) > num)
                        {
                            break;
                        }
                    }
                    if (stop == 1)
                    {
                        break;
                    }
                }
                if (stop == 1)
                {
                    cout << i + j << endl;
                    if (j != 0)
                    {
                        for (int m = 0; m < j*one; m++)
                        {
                            if (m%one == 0 && m != 0)
                            {
                                cout << endl;
                            }
                            cout << kalam[m];
                        }
                        cout << endl;
                    }
                    if (i != 0)
                    {
                        for (int m = i*one; m < num; m++)
                        {
                            if (coun == two)
                            {
                                cout << endl;
                                coun = 0;
                            }
                            cout << kalam[m];
                            coun++;
                        }
                    }
                }
                else
                {
                    cout << -1 << endl;
                }
            }
        }
    }
    return 0;
}


#include <iostream>
#include <string>
using namespace std;

int main()
{
    //while(true)
    {
        long long num,one,two,i,j,coun=0;
        string kalam;
        bool stop = 0;
        cin >> num>>one>>two;
        cin >> kalam;
        {

            {
                for (i = 0; i <= num; i++)
                {
                    for (j = 0; j <= num; j++)
                    {
                        if ((i*one) + (j*two) == num)
                        {
                            stop = 1;
                            break;
                        }
                        if ((i*one) + (j*two) > num)
                        {
                            break;
                        }
                    }
                    if (stop == 1)
                    {
                        break;
                    }
                }
                if (stop == 1)
                {
                    cout << i + j << endl;
                    if (i != 0)
                    {
                        for (int m = 0; m < i*one; m++)
                        {
                            if (m%one == 0 && m != 0)
                            {
                                cout << endl;
                            }
                            cout << kalam[m];
                        }
                        cout << endl;
                    }
                    if (j != 0)
                    {
                        for (int m = i*one; m < num; m++)
                        {
                            if (coun == two)
                            {
                                cout << endl;
                                coun = 0;
                            }
                            cout << kalam[m];
                            coun++;
                        }
                    }
                }
                else
                {
                    cout << -1 << endl;
                }
            }

        }
    }
    return 0;
}


#include <iostream>
#include <string>
using namespace std;

int main()
{
    long long num, one, two, i, j, z = 0;
    bool stop = 0;
    char word[1000];
    cin >> num >> one >> two;
    for (int i = 0; i < num; i++)
    {
        cin >> word[i];
    }
    if (one + two == num)
    {
        cout << 2 << endl;
        for (int i = 0; i < one; i++)
        {
            cout << word[i];
        }
        cout << endl;
        for (int i = one; i < num; i++)
        {
            cout << word[i];
        }
    }
    else if (one + two<num)
    {
        if (one >= two)
        {
            for (i = 0; i <= num; i++)
            {
                if ((i*two) == num)
                {
                    stop = 1;
                    break;
                }
                if ((i*two) > num)
                {

                    break;
                }
            }

            if (stop == 1)
            {
                cout << i << endl;

                z = 0;
                for (int a = 1; a <= i; a++)
                {
                    for (int q = z; z < a*two; z++)
                    {
                        cout << word[z];
                    }
                    cout << endl;
                    z = (a*two);
                }
            }
            else if (stop == 0)
            {
                cout << -1;
            }
        }
        else
        {
            for (i = 0; i <= num; i++)
            {
                if ((i*one) == num)
                {
                    stop = 1;
                    break;
                }
                if ((i*one) > num)
                {

                    break;
                }
            }

            if (stop == 1)
            {
                cout << i << endl;
                z = 0;
                for (int a = 1; a <= i; a++)
                {
                    for (int q = z; z < a*one; z++)
                    {
                        cout << word[z];
                    }
                    cout << endl;
                    z = (a*one);
                }
            }
            else if (stop == 0)
            {
                cout << -1;
            }
        }
    }
    else if (one + two>num)
    {
        if (one <= two)
        {
            for (i = 0; i <= num; i++)
            {

                    if ( (i*one) == num)
                    {
                        stop = 1;
                        break;
                    }
                    if ((i*one) > num)
                    {

                        break;
                    }

            }
            if (stop == 1)
            {
                cout << i << endl;

                for (int a = 1; a <= i; a++)
                {
                    for (int q = z; z<a*one; z++)
                    {
                        cout << word[z];
                    }
                    cout << endl;
                    z = (a*one);
                }
            }
            else
            {
                cout << -1;
            }

        }
        else
        {
            for (i = 0; i <= num; i++)
            {

                    if ((i*two)  == num)
                    {
                        stop = 1;
                        break;
                    }
                    if ((i*two) > num)
                    {

                        break;
                    }
            }
            if (stop == 1)
            {
                cout << i << endl;
                z = 0;
                for (int a = 1; a <= i; a++)
                {
                    for (int q = z; z<a*two; z++)
                    {
                        cout << word[z];
                    }
                    cout << endl;
                    z = (i*two);
                }
            }
            else
            {
                cout << -1;
            }
        }
    }
    return 0;
}