CF632E.Thief in a Shop

A thief made his way to a shop.

As usual he has his lucky knapsack with him. The knapsack can contain k objects. There are n kinds of products in the shop and an infinite number of products of each kind. The cost of one product of kind i is a__i.

The thief is greedy, so he will take exactly k products (it's possible for some kinds to take several products of that kind).

Find all the possible total costs of products the thief can nick into his knapsack.

一个小偷潜入了一家商店。

和往常一样，他随身携带着他那幸运的背包。该背包恰好能装下 $k$ 件物品。商店中有 $n$ 种商品，且每种商品的数量均为无限。第 $i$ 种商品的单价为 $a_i$。

这个小偷非常贪婪，因此他一定会恰好拿走 $k$ 件商品（同一种商品可以拿多件）。

请找出小偷能装入背包的所有可能的总费用。

The first line contains two integers n and k (1 ≤ n, k ≤ 1000) — the number of kinds of products and the number of products the thief will take.

The second line contains n integers a__i (1 ≤ a__i ≤ 1000) — the costs of products for kinds from 1 to n.

第一行包含两个整数 $n$ 和 $k$（$1 \leq n, k \leq 1000$）—— 分别表示商品种类数以及小偷将要窃取的商品数量。

第二行包含 $n$ 个整数 $a_i$（$1 \leq a_i \leq 1000$）—— 表示第 $1$ 到第 $n$ 种商品的单价。

Print the only line with all the possible total costs of stolen products, separated by a space. The numbers should be printed in the ascending order.

输出唯一的一行，包含所有可能的被盗商品总费用，各数字之间用空格分隔。这些数字应按升序排列。