Problem:
Score : 200 points

Problem Statement

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.

Sample Input 1

5 3
50 100 80 120 80

Sample Output 1

210

This shop sells Fruit 1, 2, 3, 4, and 5 for 50 yen, 100 yen, 80 yen, 120 yen, and 80 yen, respectively.

The minimum total price for three kinds of fruits is 50 + 80 + 80 = 210 yen when choosing Fruit 1, 3, and 5.

Sample Input 2

1 1
1000

Sample Output 2

1000

Solution in PHP (7.4.4) (judge verdict: Wrong Answer)

<?php
  
  $a = explode(" ",fgets(STDIN));
  $b = explode(" ",fgets(STDIN));

  sort($b);

  echo calculate($a,$b);

  function calculate($a,$b){
    
     $total = 0;
    
    if($a[1] == 0){
    	return 0; 
    }
    
    if($a[1] == 1){
    	return $b[0]; 
    }

    for($i=0; $i < $a[1]; $i++){
      $total += $b[$i];
    }

    return $total;
  }