#include using namespace std; typedef long long ll; typedef pair P; #define REP(i,n) for(int i=0;i> N >> K; vector a(N+1,0),b(N); for(i=0;i> b[i]; a[i+1]=b[i]; } sort(b.begin(),b.end()); int x=b[K-1]; vector v; for(i=2;i<=N;i++){ if(a[i-1]<=x && a[i]>x) v.push_back(i); } cout << (int)v.size() << endl; REP(i,v.size()) cout << v[i] << ' '; cout << endl; return 0; }