#include <bits/stdc++.h>
using namespace std;
int main() {
  map<int, int> mapp;
  int n, k, temp;
  scanf("%d %d", &n, &k);
  for (int i = 0; i < n; i++) {
    scanf("%d", &temp);
    mapp[temp] = i + 1;
  }
  if (mapp.size() >= k) {
    printf("YES\n");
    vector<int> a;
    for (map<int, int>::iterator it = mapp.begin(); k > 0; it++) {
      a.push_back(it->second);
      k--;
    }
    sort(a.begin(), a.end());
    for (int i = 0; i < a.size(); i++) printf("%d ", a[i]);
    printf("\n");
  } else
    printf("NO\n");
  return 0;
}
