#include using namespace std; typedef long long ll; typedef vector vi; typedef vector vl; typedef pair pii; typedef pair pll; typedef int _loop_int; #define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i) #define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i) #define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i) #define DEBUG(x) cout<<#x<<": "< P; ll s; int poran(){ s *= 12345ll; s %= 1000003ll; return (int)s; } int n; int p; vi g[125]; int f[125][125]; vector ng(125,false); // bool ng[125]; int pri[125]; int mxval; vi mxans; uint32_t xor64(void) { static uint64_t x = 88172645463325252ULL; x = x ^ (x << 13); x = x ^ (x >> 7); return x = x ^ (x << 17); } using namespace std::chrono; // これ? // http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2550 int main(){ milliseconds beg = duration_cast(system_clock::now().time_since_epoch()); // input scanf("%lld",&s); n = poran()%120 + 2; p = poran(); FOR(i,0,n)FOR(j,i+1,n){ int x = poran(); if(x>=p){ g[i].push_back(j); g[j].push_back(i); } } REP(i,n)pri[i] = i; mxval = 0; // randomized while(true){ REP(_,2521){ // fisher-yates shuffle FORR(i,2,n+1){ swap(pri[i-1],pri[xor64()%i]); } // init fill(ALL(ng),false); vi tmp(n,0); int iter = 0; // calc REP(i,n){ int x = pri[i]; if(!ng[x]){ // use ng[x] = true; tmp[iter++] = x; for(int to:g[x]){ ng[to] = true; } } } if(iter > mxval){ mxval = iter; mxans = tmp; } } // check milliseconds now = duration_cast(system_clock::now().time_since_epoch()); if((now-beg).count() >= 7800)break; } // output if(mxval==n){ puts("-1"); }else{ printf("%d\n",mxval+1); printf("%d",mxans[0]+1); FOR(i,1,mxval)printf(" %d",mxans[i]+1); putchar('\n'); } return 0; }