#include <bits/stdc++.h>
int med(int x, int y, int z) {
  if (x < y) {
    if (y < z)
      return y;
    else if (z < x)
      return x;
    else
      return z;
  } else {
    if (x < z)
      return x;
    else if (z < y)
      return y;
    else
      return z;
  }
}
void quick_sort(int a[], int left, int right) {
  if (left < right) {
    int i = left, j = right, tmp, pivot = med(a[i], a[i + (j - i) / 2], a[j]);
    while (1) {
      while (a[i] < pivot) i++;
      while (pivot < a[j]) j--;
      if (i >= j) break;
      tmp = a[i];
      a[i] = a[j];
      a[j] = tmp;
      i++;
      j--;
      quick_sort(a, left, i - 1);
      quick_sort(a, j + 1, right);
    }
  }
}
int main(void) {
  int n, k, i, min = 0;
  int *p;
  scanf("%d %d", &n, &k);
  if ((p = (int *)calloc(n, sizeof(int))) == NULL) exit(1);
  for (i = 0; i < n; i++) scanf("%d", &p[i]);
  quick_sort(p, 0, n - 1);
  for (i = 0; i < k; i++) min += p[i];
  printf("%d", min);
  free(p);
  return 0;
}
