Alok-nath is man of equality. He needs your help to divide his “sanskars” evenly amongst all his followers. By doing this, Alok-nath can create equality amongst his followers and he'll be called a true “sanskari”.
Alok-nath 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
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}.
import sys
x = lambda : [int(n) for n in sys.stdin.readline().rstrip().split()]
t = int(sys.stdin.readline().rstrip())
def f(a, n, s):
    if s==0:
        return 1
    if n==0 and s != 0:
        return 0
    if a[n-1] > s or a[n-1] == 0:
        return f(a, n-1, s)
    if f(a, n-1, s - a[n-1]):
        a[n-1] = 0
        return 1
    return f(a,n-1, s)
while t:
    (n,k) = x()
    a = x()
    a.sort()
    s = sum(a)
    done = False
    if n>=k and s % k == 0:
        avg = s/k
        if a[len(a)-1]<=avg:
            done = True
            for i in range(k):
                if(not f(a, n, avg)):
                    done = False
                    break
    print "yes" if done else "no"
    t-=1