#include <bits/stdc++.h>
namespace LYD {
inline int read() {
  int x = 0, data = 1;
  char ch = getchar();
  while ((ch > '9' || ch < '0') && ch != '-') ch = getchar();
  if (ch == '-') {
    ch = getchar();
    data = -1;
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * data;
}
}  // namespace LYD
int st[105], ans[105];
using namespace LYD;
namespace solve {}
using namespace solve;
int main() {
  int n = read(), k = read(), tot = 0;
  for (int i = 1; i <= n; ++i) {
    int x = read();
    if (st[x] == 0) {
      ++tot;
      st[x] = i;
    }
  }
  if (tot < k) {
    printf("NO");
    return 0;
  }
  int num = 0, ans_num = 0;
  printf("YES\n");
  for (int i = 1; i <= k; ++i) {
    while (st[num] == 0) ++num;
    ++ans_num;
    ans[ans_num] = st[num];
    ++num;
  }
  std ::sort(ans + 1, ans + ans_num + 1);
  for (int i = 1; i < ans_num; ++i) printf("%d ", ans[i]);
  printf("%d", ans[ans_num]);
  return 0;
}
