Mix Juice

Source: AtCoder

Version: Phuoc Hung OJ Extended

Problem Statement

A shop sells $N$ fruit types, and type $i$ costs $p_i$. Choose exactly $K$ distinct types and buy one item of each. Find the minimum total price.

Input

The first line contains $N, K$. The second line contains $p_1,\ldots,p_N$.

Output

Print the minimum total price.

Subtasks

General constraints:

• $1 \le K \le N \le 1000$.

• $1 \le p_i \le 1000$.

• Subtask 1 (20 points): $N \le 20$

• Subtask 2 (30 points): $N \le 200$

• Subtask 3 (50 points): No additional constraints.

Examples

Input

5 3
50 100 80 120 80

Output

210

Explanation

The three smallest prices are $50,80,80$, whose sum is $210$.