#include <bits/stdc++.h>
using namespace std;
int main() {
  int k, n;
  while (cin >> n >> k) {
    vector<int> a, b, pos, ci;
    int i, x;
    for (i = 1; i <= n; i++) {
      cin >> x;
      a.push_back(x);
      b.push_back(x);
    }
    sort(a.begin(), a.end());
    int c = 1, j;
    pos.push_back(a[0]);
    for (i = 0; i < n - 1; i++) {
      if (a[i] != a[i + 1]) {
        c++;
        pos.push_back(a[i + 1]);
      }
    }
    if (c >= k) {
      cout << "YES" << endl;
      for (i = 0; i < k; i++) {
        for (j = 0; j < n; j++) {
          if (pos[i] == b[j]) {
            ci.push_back(j + 1);
            break;
          }
        }
      }
      sort(ci.begin(), ci.end());
      for (i = 0; i < k; i++) {
        cout << ci[i] << " ";
      }
      cout << endl;
    } else {
      cout << "NO" << endl;
    }
  }
}
