DSA02009 - CHIA MẢNG

//Made By Phuong Nam PROPTIT <3//
#pragma GCC Optimize("O3")
#include<bits/stdc++.h>
#include<string>
#include<vector>
#define alphaa "abcdefghijklmnopqrstuvwxyz"
#define ALPHAA "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define f(i,a,b) for(int i=a;i<=b;i++)
#define f1(i,n) for(int i=1;i<=n;i++)
#define f0(i,n) for(int i=0;i<n;i++)
#define ff(i,b,a) for(int i=b;i>=a;i--)
#define el cout<<'\n'
#define fi first
#define se second
#define pb push_back
#define pk pop_back
#define vi vector<int>
#define vl vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define all(s) s.begin(),s.end()
using namespace std;
typedef long long ll;
const int N=1e3+3;
const int MOD=1e9+7;
template<class X,class Y>
    void minimize(X &x,const Y &y) {
        if (x>y) x=y;
    }
template<class X,class Y>
    void maximize(X &x,const Y &y) {
        if (x<y) x=y;
    }
template<class T>
    T Abs(const T &x) {
        return (x<0?-x:x);
    }
int n,a[25],k,f[25],s=0;
bool kt=0;
void quay(int d,int dem)
{
    if(d>s) return;
    if(kt) return;
    if(dem==k)
    {
        kt=1;
        return;
    }
    f1(i,n)
    {
        if(!f[i])
        {
            f[i]=1;
            if(d==s)
            {
                quay(0,dem+1);
                return;
            }
            if(d>s) return;
            quay(d+a[i],dem);
        }
        f[i]=0;
    }
}
void xuly()
{
    memset(f,0,sizeof(f));
    kt=0;
    s=0;
    cin>>n>>k;
    f1(i,n)
    {
        cin>>a[i];
        s+=a[i];
    }
    if(s%k) cout<<0;
    else
    {
        s/=k;
        quay(0,0);
        cout<<kt;
    }
    el;
}
int main()
{
  ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
  int t=1;
  cin>>t;
  while(t--) xuly();
  return 0;
}
//-----YEU CODE HON CRUSH-----//