Aloknath and His Sanskars

All submissions for this problem are available.
Read problems statements in Mandarin Chinese and Russian.
Aloknath is man of equality. He needs your help to divide his “sanskars” evenly amongst all his followers. By doing this, Aloknath can create equality amongst his followers and he'll be called a true “sanskari”.
Aloknath has N sanskars, and K followers. Each sanskar is given a numerical value which shows its intensity.
Your task is to determine whether it is possible to allocate all the sanskars to followers in such a way that the sum of intensities of the sanskars allocated to each follower is equal. Note : A sanskar can be allocated to only one of the followers.
Input
The first line of the input contains an integer T, denoting the number of test cases. Then T test cases follow. The first line of each case contains two integers N and K, with N denoting the number of sanskars and K denoting the number of followers. In the next line are N space separated integers denoting the intensities of each sanskar.
Output
For each test case, output "yes" if it is possible to divide his sanskars equally amongst his followers; otherwise output "no" (without quotes).
Constraints
 1 ≤ T ≤ 10
 1 ≤ N ≤ 21
 1 ≤ K ≤ 8
 Subtask #1 (20 points) : 0 ≤ intensity of sanskar ≤ 10^5
 Subtask #2 (80 points) : 0 ≤ intensity of sanskar ≤ 10^10
Example
Input: 2 5 3 1 2 4 5 6 5 3 1 2 4 5 7 Output: yes no
Explanation
In the first case, sanskars can be allocated as follows, each follower receiving a total intensity of 6: {1,5}, {2,4}, {6}.
Author:  jay_adm 
Tester:  shiplu 
Editorial  http://discuss.codechef.com/problems/SANSKAR 
Tags  bit, dec14, dynamicprogramming, easy, jay_adm 
Date Added:  21022014 
Time Limit:  1 sec 
Source Limit:  50000 Bytes 
Languages:  C, CPP14, JAVA, PYTH, PYTH 3.5, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, SCALA, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, PERL6, TEXT, CLOJ, FS 
Comments
 Please login at the top to post a comment.
SUCCESSFUL SUBMISSIONS
Fetching successful submissions
HELP
If you are still having problems, see a sample solution here. 