题目描述
A shop sells N kinds of fruits, Fruit $1, \ldots, N,$ at prices of $p_1, \ldots, p_N$ yen per item, respectively. (Yen is the currency of Japan.)
Here, we will choose K kinds of fruits and buy one of each chosen kind. Find the minimum possible total price of those fruits.
Constraints
- $1 \leq K \leq N \leq 1000$
- $1 \leq p_i \leq 1000$
- All values in input are integers.
Input
Input is given from Standard Input in the following format:
N K
$p_1 p_2 \ldots p_N$
Output
Print an integer representing the minimum possible total price of fruits.
Examples
Input
5 3
50 100 80 120 80
Output
210
Input
1 1
1000
Output
1000
输入格式
见题面
输出格式
见题面
样例输入
1 1
1000
样例输出
1000