#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k;
  cin >> n >> k;
  vector<int> V(n);
  vector<bool> has(1000, false);
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    V[i] = x;
    has[x] = true;
  }
  int a = 0;
  for (int i = 0; i < has.size(); i++) {
    if (has[i]) {
      a++;
    }
  }
  if (a >= k) {
    cout << "YES" << endl;
    int j = 0, i = 0;
    vector<int> ans(0), ans2(0);
    while (i < k) {
      if (find(ans.begin(), ans.end(), V[j]) == ans.end()) {
        ans.push_back(V[j]);
        ans2.push_back(j);
        i++;
      }
      j++;
    }
    for (int i = 0; i < k; i++) {
      cout << ans2[i] + 1 << ' ';
    }
    cout << endl;
  } else {
    cout << "NO" << endl;
  }
  return 0;
}
