#include #include using namespace std; typedef signed long long ll; #undef _P #define _P(...) (void)printf(__VA_ARGS__) #define FOR(x,to) for(x=0;x<(to);x++) #define FORR(x,arr) for(auto& x:arr) #define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++) #define ALL(a) (a.begin()),(a.end()) #define ZERO(a) memset(a,0,sizeof(a)) #define MINUS(a) memset(a,0xff,sizeof(a)) //------------------------------------------------------- ll S; int N,P; vector E[130]; int A[200]; static unsigned long long seed = 88172645463325252ULL; unsigned long long xor_rand() { seed ^= (seed << 13); seed ^= (seed >> 7); return seed ^= (seed << 17); } ll nex(){ return S=(S*12345)%1000003;} void solve() { int i,j,k,l,r,x,y; string s; cin>>S; N=nex()%120+2; P=nex(); FOR(i,N) for(j=i+1;j=P) E[i].push_back(j), E[j].push_back(i); FOR(i,N) A[i]=i; struct timeval tv1,tv2; gettimeofday(&tv1,NULL); vector R; R.push_back(0); y=0; while(1) { gettimeofday(&tv2,NULL); if((tv2.tv_sec-tv1.tv_sec)*1000000+(tv2.tv_usec-tv1.tv_usec)>4000000) break; seed = tv1.tv_usec; FOR(i,1000) { y++; bitset<128> B; vector T; FOR(j,N-1) swap(A[j],A[j+xor_rand() % (N-j)]); FOR(j,N) if(B.test(A[j])==0) { T.push_back(A[j]+1); FORR(e,E[A[j]]) B.set(e); } if(R.size()