 Geek and Subset Sum
Easy Accuracy: 68.43% Submissions: 279 Points: 2

Given an array arr of positive integers of size N and an integer K, the task is to find the sum of all subsets of size K.

Input:
1. The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows.
2. The first line of each test case contains two integers N and K.
3. The next line contains N space-separated integers.

Output: For each test case, print the answer

Constraints:
1. 1 <= T <= 10

2. 1 <=  K <= N <= 12
3. 1 <= arr[i] <= 100

Example:
Input:

2
4 2
1 2 3 5
1 1
20

Output:
33
20

Explanation:
Test Case 1: Subsets are {1, 2}, {1, 3}, {1, 5}, {2, 3}, {2, 5}, {3, 5}, Summation of all subsets sum = 3 + 4 + 6 + 5 + 7 + 8 = 33

We are replacing the old Disqus forum with the new Discussions section given below.

### Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

#### My Submissions:  