#include <bits/stdc++.h>
using namespace std;
int a[105];
void solve() {
  int n, k;
  cin >> n >> k;
  vector<int> v(n + 1);
  unordered_set<int> s;
  for (int i = 1; i <= n; i++) {
    int temp = 0;
    cin >> temp;
    v.push_back(temp);
    s.insert(temp);
    a[temp] = i;
  }
  int ss = s.size();
  if (ss < k)
    cout << "NO" << endl;
  else {
    cout << "YES" << endl;
    int v = k;
    for (auto i : s)
      if (v > 0) {
        cout << a[i] << ' ';
        v--;
      }
  }
  cout << endl;
}
int main() {
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
