#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-9;
const double PI = acos(-1);
const long long MOD = 1e9 + 7;
const int INF = 0x7FFFFFFF;
const long long LINF = 0x7FFFFFFFFFFFFFFFLL;
const unsigned long long UINF = 0xFFFFFFFFFFFFFFFFLL;
const int dCol[] = {0, +1, 0, -1, +1, +1, -1, -1};
const int dRow[] = {-1, 0, +1, 0, -1, +1, +1, -1};
template <typename T>
inline void VIN(vector<T> &i) {
  T x;
  cin >> x;
  i.push_back(x);
}
inline void FIO(string i) {
  freopen((i + ".in").c_str(), "r", stdin);
  freopen((i + ".out").c_str(), "w", stdout);
}
int N, K, data[105];
bool stt[10005];
queue<int> ans;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  stt[0] = 1;
  cin >> N >> K;
  for (int i = (0); i < (N); i++) {
    int x;
    cin >> x;
    if (!stt[x]) {
      stt[x] = 1;
      ans.push(i + 1);
    }
  }
  if (ans.size() < K) {
    cout << "NO"
         << "\n";
    return 0;
  }
  cout << "YES"
       << "\n";
  for (int i = (0); i < (K); i++) {
    cout << ans.front();
    ans.pop();
    if (i == K - 1)
      cout << "\n";
    else
      cout << " ";
  }
  return 0;
}
