Subset Sum

Given a multiset of integers $A = \\{a\_1, a\_2, \dots, a\_n\\}$, print the least $k$ sums among all non-empty subsets in sorted order.

The first line contains $2$ integers $n, k$ ($1 \leq n \leq 200000, 1 \leq k \leq \min\\{2^n - 1, 200000\\}$).

The second line contains $n$ integers $a\_1, a\_2, \dots, a\_n$ ($|a\_i| \leq 10^9$).

$k$ integers denote the least $k$ sums.