K Subset Sums I

You are given an array of n integers. Consider the sums of all 2^n subsets of the given array (including the empty subset with sum equal to zero). Your task is to find the k smallest subset sums. Input The first line has two integers n and k: the size of the array and the number of subset sums k. The next line has n integers x_1, x_2,\dots, x_n: the contents of the array. Output Print k inte