#include <stdio.h>
#include <stdlib.h>

int t[524287] = {};
int size = 1;

void set_segt (int *t, int idx, int val, int size) {
  idx = idx+size-1;
  t[idx] = val;
  
  while (idx > 0) {
    idx = (idx-1)/2;
    if (t[2*idx+1] > 0) {
      t[idx] = 1;
    } else if (t[2*idx+1] < 0) {
      t[idx] = -1;
    } else {
      t[idx] = t[2*idx+2];
    }
  }
  
  return;
}

int add_segt_rec (int *t, int a, int b, int k, int l, int r) {
  int ans = 0;
  
  if (r <= a || b <= l) {
    return 0;
  }
  
  if (a <= l && r <= b) {
    return t[k];
  }
  
  ans = add_segt_rec(t, a, b, 2*k+1, l, (l+r)/2);
  if (ans == 0) {
    ans = add_segt_rec(t, a, b, 2*k+2, (l+r)/2, r);
  }
  
  return ans;
}

int add_segt (int *t, int a, int b, int size) {
  return add_segt_rec(t, a, b, 0, 0, size);
}

int cmp_idx (const void *ap, const void *bp) {
  int a = *(int *)ap;
  int b = *(int *)bp;
  if (a == b) {
    return 0;
  }
  if (a > b) {
    return (-1)*cmp_idx(bp, ap);
  }  
  return add_segt(t, a, b, size);
}

int main () {
  int n = 0;
  int k = 0;
  int a[200000] = {};
  
  int res = 0;
  
  int ans[200000] = {};
  int b[200000] = {};
  
  res = scanf("%d", &n);
  res = scanf("%d", &k);
  for (int i = 0; i < n; i++) {
    res = scanf("%d", a+i);
    ans[i] = i;
  }
  
  while (size < n) {
    size <<= 1;
  }
  
  for (int i = 0; i < n-1; i++) {
    int val = 0;
    if (a[i] < a[i+1]) {
      val = 1;
    } else if (a[i] > a[i+1]) {
      val = -1;
    }
    set_segt(t, i, val, size);
  }
  
  qsort(ans, n, sizeof(int), cmp_idx);
  
  for (int i = 0; i < ans[k-1]; i++) {
    b[i] = a[i];
  }
  for (int i = ans[k-1]; i < n-1; i++) {
    b[i] = a[i+1];
  }
  
  
  printf("%d", b[0]);
  for (int i = 1; i < n-1; i++) {
    printf(" %d", b[i]);
  }
  printf("\n");
  
  return 0;
}