19133번 - 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.

제한

힌트