#include <bits/stdc++.h>
using namespace std;
int n;
pair<int, int> a[1005];
int m;
vector<int> v;
int main() {
  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    cin >> a[i].first;
    a[i].second = i + 1;
  }
  sort(a, a + n);
  if (a[0].first != a[1].first) v.push_back(a[0].second);
  for (int i = 1; i < n; i++) {
    if (a[i].first != a[i - 1].first) v.push_back(a[i].second);
  }
  if (v.size() < m) {
    cout << "NO";
    return 0;
  }
  cout << "YES\n";
  for (int i = 0; i < m; i++) {
    cout << v[i] << " ";
  }
}
