import java.util.PriorityQueue;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		PriorityQueue<Integer> pq = new PriorityQueue<>();

		int n,k = 0;
		n = scanner.nextInt();
		k = scanner.nextInt(); // 買う果物

		while (n-- > 0){
			pq.add(scanner.nextInt());
		}

		int sum = 0;
		while (k-- > 0){
			sum += pq.poll();
		}
		System.out.println(sum);

	}

}

/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz