Jewelry Store

A thief broke into a jewelry store. The thief wants to carry off exactly $K$ gems.

The store stocks $N$ kinds of gems. Gems of kind $i$ are worth $a_i$ each, and every kind is available in unlimited supply.

Write a program that finds every total value the thief can carry off.

The first line contains $N$ and $K$. ($1 \le N, K \le 1000$)

The second line contains $a_1, a_2, \dots, a_N$ separated by spaces. ($1 \le a_i \le 1000$) The same value may appear more than once.

Print every reachable total value on one line in ascending order. Separate two consecutive totals with a single space. Print each total only once.