#include <bits/stdc++.h>
using namespace std;

#define rep(i, j, n) for (int i = (int)j; i < (int)n; i++)

int main() {
  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  rep(i, 0, n)
    cin >> a[i];
  vector<int> b = a;
  sort(b.begin(), b.end());
  int det = b[k - 1];
  vector<int> ans;
  rep(i, 1, n) {
    if (a[i-1] <= det && a[i] > det)
      ans.push_back(i+1);
  }
  cout << (int)ans.size() << endl;
  for (int n : ans)
    cout << n << " ";
  cout << endl;
  return 0;
}