#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k, a[100];
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  int cont = 0;
  unordered_set<int> us, us2;
  for (int j = 0; j < n; j++) {
    if (us.find(a[j]) == us.end()) {
      cont++;
      us.insert(a[j]);
      us2.insert(j + 1);
    }
    if (cont == k) {
      cout << "YES" << endl;
      break;
    }
  }
  if (cont == k) {
    unordered_set<int>::iterator itr;
    for (itr = us2.begin(); itr != us2.end(); itr++) cout << *itr << " ";
  } else {
    cout << "NO" << endl;
  }
  return 0;
}
