Compilare: user.cpp: In function ‘int main()’: user.cpp:3:688: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result] using namespace std;const int MOD=666013;int v[200005],n;struct culoare{int c,ans;};culoare vop[200005];int bsst(int st,int dr,int x){int med,last;while(st<=dr){med=(st+dr)/2;if(vop[med].c==x)last=med;if(vop[med].c>=x)dr=med-1;else st=med+1;}return last;}bool cmp(culoare a,culoare b){return a.c<b.c;}void afis(int k){for(int i=0;i<=k;i++)printf("%d ",v[i]);printf("\n");}void backforward(int poz,int k,int c){if(n==0)return;if(poz==k+1){afis(k);n--;}else for(int i=1;i<=c;i++){v[poz]=i;backforward(poz+1,k,c);}}void backback(int poz,int k,int c){if(n==0)return;if(poz==k+1){afis(k);n--;}else for(int i=c;i>=1;i--){v[poz]=i;backback(poz+1,k,c);}}int main(){freopen("procol.in","r",stdin);freopen("procol.out","w",stdout);int op;scanf("%d",&op);if(op==1){int nr=0,k,c,x,maxim,poz;scanf("%d%d%d",&n,&k,&c);for(register int i=1;i<=n;++i)for(register int j=1;j<=k;++j){scanf("%d",&x);vop[++nr].c=x;}sort(vop+1,vop+nr+1,cmp);fclose(stdin);freopen("procol.in","r",stdin);freopen("procol.out","w",stdout);scanf("%d%d%d%d",&op,&n,&k,&c);for(int i=1;i<=n;i++){maxim=0;for(int j=1;j<=k;j++){scanf("%d",&v[j]);poz=bsst(1,n*k,v[j]);if(vop[poz].ans+1>maxim)maxim=vop[poz].ans+1;}for(int j=1;j<=k;j++){poz=bsst(1,n*k,v[j]);vop[poz].ans=maxim;}}maxim=0;for(int j=1;j<=n*k;j++)if(vop[j].ans>maxim)maxim=vop[j].ans;printf("%d\n",maxim);}else if(op==2){int k,c,ap;scanf("%d%d",&k,&c);for(int i=1;i<=k;i++)scanf("%d",&v[i]);sort(v+1,v+k+1);ap=0;for(int i=1;i<=k;i++)if(v[i]!=v[i-1])++ap;long long ans1=1;for(int i=1;i<=k;i++)ans1=((1LL)*ans1*c)%MOD;long long ans2=1;for(int i=1;i<=k;i++)ans2=((1LL)*ans2*(c-ap))%MOD;printf("%lld\n",(MOD+ans1-ans2)%MOD);}else if(op==3){int k,c;scanf("%d%d%d",&n,&k,&c);long long rez1=1;bool ok=0;for(register int i=1;i<=k;++i){rez1=(1LL)*rez1*c;if(rez1>=n){ok=1;break;}}if(ok==0){printf("-1\n");return 0;}for(register int i=1;i<=c&&n>0;++i){v[0]=i;if(i%2==1)backforward(1,k-1,c);else backback(1,k-1,c);}}} ^ user.cpp:3:721: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result] using namespace std;const int MOD=666013;int v[200005],n;struct culoare{int c,ans;};culoare vop[200005];int bsst(int st,int dr,int x){int med,last;while(st<=dr){med=(st+dr)/2;if(vop[med].c==x)last=med;if(vop[med].c>=x)dr=med-1;else st=med+1;}return last;}bool cmp(culoare a,culoare b){return a.c<b.c;}void afis(int k){for(int i=0;i<=k;i++)printf("%d ",v[i]);printf("\n");}void backforward(int poz,int k,int c){if(n==0)return;if(poz==k+1){afis(k);n--;}else for(int i=1;i<=c;i++){v[poz]=i;backforward(poz+1,k,c);}}void backback(int poz,int k,int c){if(n==0)return;if(poz==k+1){afis(k);n--;}else for(int i=c;i>=1;i--){v[poz]=i;backback(poz+1,k,c);}}int main(){freopen("procol.in","r",stdin);freopen("procol.out","w",stdout);int op;scanf("%d",&op);if(op==1){int nr=0,k,c,x,maxim,poz;scanf("%d%d%d",&n,&k,&c);for(register int i=1;i<=n;++i)for(register int j=1;j<=k;++j){scanf("%d",&x);vop[++nr].c=x;}sort(vop+1,vop+nr+1,cmp);fclose(stdin);freopen("procol.in","r",stdin);freopen("procol.out","w",stdout);scanf("%d%d%d%d",&op,&n,&k,&c);for(int i=1;i<=n;i++){maxim=0;for(int j=1;j<=k;j++){scanf("%d",&v[j]);poz=bsst(1,n*k,v[j]);if(vop[poz].ans+1>maxim)maxim=vop[poz].ans+1;}for(int j=1;j<=k;j++){poz=bsst(1,n*k,v[j]);vop[poz].ans=maxim;}}maxim=0;for(int j=1;j<=n*k;j++)if(vop[j].ans>maxim)maxim=vop[j].ans;printf("%d\n",maxim);}else if(op==2){int k,c,ap;scanf("%d%d",&k,&c);for(int i=1;i<=k;i++)scanf("%d",&v[i]);sort(v+1,v+k+1);ap=0;for(int i=1;i<=k;i++)if(v[i]!=v[i-1])++ap;long long ans1=1;for(int i=1;i<=k;i++)ans1=((1LL)*ans1*c)%MOD;long long ans2=1;for(int i=1;i<=k;i++)ans2=((1LL)*ans2*(c-ap))%MOD;printf("%lld\n",(MOD+ans1-ans2)%MOD);}else if(op==3){int k,c;scanf("%d%d%d",&n,&k,&c);long long rez1=1;bool ok=0;for(register int i=1;i<=k;++i){rez1=(1LL)*rez1*c;if(rez1>=n){ok=1;break;}}if(ok==0){printf("-1\n");return 0;}for(register int i=1;i<=c&&n>0;++i){v[0]=i;if(i%2==1)backforward(1,k-1,c);else backback(1,k-1,c);}}} ^ user.cpp:3:744: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] using namespace std;const int MOD=666013;int v[200005],n;struct culoare{int c,ans;};culoare vop[200005];int bsst(int st,int dr,int x){int med,last;while(st<=dr){med=(st+dr)/2;if(vop[med].c==x)last=med;if(vop[med].c>=x)dr=med-1;else st=med+1;}return last;}bool cmp(culoare a,culoare b){return a.c<b.c;}void afis(int k){for(int i=0;i<=k;i++)printf("%d ",v[i]);printf("\n");}void backforward(int poz,int k,int c){if(n==0)return;if(poz==k+1){afis(k);n--;}else for(int i=1;i<=c;i++){v[poz]=i;backforward(poz+1,k,c);}}void backback(int poz,int k,int c){if(n==0)return;if(poz==k+1){afis(k);n--;}else for(int i=c;i>=1;i--){v[poz]=i;backback(poz+1,k,c);}}int main(){freopen("procol.in","r",stdin);freopen("procol.out","w",stdout);int op;scanf("%d",&op);if(op==1){int nr=0,k,c,x,maxim,poz;scanf("%d%d%d",&n,&k,&c);for(register int i=1;i<=n;++i)for(register int j=1;j<=k;++j){scanf("%d",&x);vop[++nr].c=x;}sort(vop+1,vop+nr+1,cmp);fclose(stdin);freopen("procol.in","r",stdin);freopen("procol.out","w",stdout);scanf("%d%d%d%d",&op,&n,&k,&c);for(int i=1;i<=n;i++){maxim=0;for(int j=1;j<=k;j++){scanf("%d",&v[j]);poz=bsst(1,n*k,v[j]);if(vop[poz].ans+1>maxim)maxim=vop[poz].ans+1;}for(int j=1;j<=k;j++){poz=bsst(1,n*k,v[j]);vop[poz].ans=maxim;}}maxim=0;for(int j=1;j<=n*k;j++)if(vop[j].ans>maxim)maxim=vop[j].ans;printf("%d\n",maxim);}else if(op==2){int k,c,ap;scanf("%d%d",&k,&c);for(int i=1;i<=k;i++)scanf("%d",&v[i]);sort(v+1,v+k+1);ap=0;for(int i=1;i<=k;i++)if(v[i]!=v[i-1])++ap;long long ans1=1;for(int i=1;i<=k;i++)ans1=((1LL)*ans1*c)%MOD;long long ans2=1;for(int i=1;i<=k;i++)ans2=((1LL)*ans2*(c-ap))%MOD;printf("%lld\n",(MOD+ans1-ans2)%MOD);}else if(op==3){int k,c;scanf("%d%d%d",&n,&k,&c);long long rez1=1;bool ok=0;for(register int i=1;i<=k;++i){rez1=(1LL)*rez1*c;if(rez1>=n){ok=1;break;}}if(ok==0){printf("-1\n");return 0;}for(register int i=1;i<=c&&n>0;++i){v[0]=i;if(i%2==1)backforward(1,k-1,c);else backback(1,k-1,c);}}} ^ user.cpp:3:804: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] using namespace std;const int MOD=666013;int v[200005],n;struct culoare{int c,ans;};culoare vop[200005];int bsst(int st,int dr,int x){int med,last;while(st<=dr){med=(st+dr)/2;if(vop[med].c==x)last=med;if(vop[med].c>=x)dr=med-1;else st=med+1;}return last;}bool cmp(culoare a,culoare b){return a.c<b.c;}void afis(int k){for(int i=0;i<=k;i++)printf("%d ",v[i]);printf("\n");}void backforward(int poz,int k,int c){if(n==0)return;if(poz==k+1){afis(k);n--;}else for(int i=1;i<=c;i++){v[poz]=i;backforward(poz+1,k,c);}}void backback(int poz,int k,int c){if(n==0)return;if(poz==k+1){afis(k);n--;}else for(int i=c;i>=1;i--){v[poz]=i;backback(poz+1,k,c);}}int main(){freopen("procol.in","r",stdin);freopen("procol.out","w",stdout);int op;scanf("%d",&op);if(op==1){int nr=0,k,c,x,maxim,poz;scanf("%d%d%d",&n,&k,&c);for(register int i=1;i<=n;++i)for(register int j=1;j<=k;++j){scanf("%d",&x);vop[++nr].c=x;}sort(vop+1,vop+nr+1,cmp);fclose(stdin);freopen("procol.in","r",stdin);freopen("procol.out","w",stdout);scanf("%d%d%d%d",&op,&n,&k,&c);for(int i=1;i<=n;i++){maxim=0;for(int j=1;j<=k;j++){scanf("%d",&v[j]);poz=bsst(1,n*k,v[j]);if(vop[poz].ans+1>maxim)maxim=vop[poz].ans+1;}for(int j=1;j<=k;j++){poz=bsst(1,n*k,v[j]);vop[poz].ans=maxim;}}maxim=0;for(int j=1;j<=n*k;j++)if(vop[j].ans>maxim)maxim=vop[j].ans;printf("%d\n",maxim);}else if(op==2){int k,c,ap;scanf("%d%d",&k,&c);for(int i=1;i<=k;i++)scanf("%d",&v[i]);sort(v+1,v+k+1);ap=0;for(int i=1;i<=k;i++)if(v[i]!=v[i-1])++ap;long long ans1=1;for(int i=1;i<=k;i++)ans1=((1LL)*ans1*c)%MOD;long long ans2=1;for(int i=1;i<=k;i++)ans2=((1LL)*ans2*(c-ap))%MOD;printf("%lld\n",(MOD+ans1-ans2)%MOD);}else if(op==3){int k,c;scanf("%d%d%d",&n,&k,&c);long long rez1=1;bool ok=0;for(register int i=1;i<=k;++i){rez1=(1LL)*rez1*c;if(rez1>=n){ok=1;break;}}if(ok==0){printf("-1\n");return 0;}for(register int i=1;i<=c&&n>0;++i){v[0]=i;if(i%2==1)backforward(1,k-1,c);else backback(1,k-1,c);}}} ^ user.cpp:3:880: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] using namespace std;const int MOD=666013;int v[200005],n;struct culoare{int c,ans;};culoare vop[200005];int bsst(int st,int dr,int x){int med,last;while(st<=dr){med=(st+dr)/2;if(vop[med].c==x)last=med;if(vop[med].c>=x)dr=med-1;else st=med+1;}return last;}bool cmp(culoare a,culoare b){return a.c<b.c;}void afis(int k){for(int i=0;i<=k;i++)printf("%d ",v[i]);printf("\n");}void backforward(int poz,int k,int c){if(n==0)return;if(poz==k+1){afis(k);n--;}else for(int i=1;i<=c;i++){v[poz]=i;backforward(poz+1,k,c);}}void backback(int poz,int k,int c){if(n==0)return;if(poz==k+1){afis(k);n--;}else for(int i=c;i>=1;i--){v[poz]=i;backback(poz+1,k,c);}}int main(){freopen("procol.in","r",stdin);freopen("procol.out","w",stdout);int op;scanf("%d",&op);if(op==1){int nr=0,k,c,x,maxim,poz;scanf("%d%d%d",&n,&k,&c);for(register int i=1;i<=n;++i)for(register int j=1;j<=k;++j){scanf("%d",&x);vop[++nr].c=x;}sort(vop+1,vop+nr+1,cmp);fclose(stdin);freopen("procol.in","r",stdin);freopen("procol.out","w",stdout);scanf("%d%d%d%d",&op,&n,&k,&c);for(int i=1;i<=n;i++){maxim=0;for(int j=1;j<=k;j++){scanf("%d",&v[j]);poz=bsst(1,n*k,v[j]);if(vop[poz].ans+1>maxim)maxim=vop[poz].ans+1;}for(int j=1;j<=k;j++){poz=bsst(1,n*k,v[j]);vop[poz].ans=maxim;}}maxim=0;for(int j=1;j<=n*k;j++)if(vop[j].ans>maxim)maxim=vop[j].ans;printf("%d\n",maxim);}else if(op==2){int k,c,ap;scanf("%d%d",&k,&c);for(int i=1;i<=k;i++)scanf("%d",&v[i]);sort(v+1,v+k+1);ap=0;for(int i=1;i<=k;i++)if(v[i]!=v[i-1])++ap;long long ans1=1;for(int i=1;i<=k;i++)ans1=((1LL)*ans1*c)%MOD;long long ans2=1;for(int i=1;i<=k;i++)ans2=((1LL)*ans2*(c-ap))%MOD;printf("%lld\n",(MOD+ans1-ans2)%MOD);}else if(op==3){int k,c;scanf("%d%d%d",&n,&k,&c);long long rez1=1;bool ok=0;for(register int i=1;i<=k;++i){rez1=(1LL)*rez1*c;if(rez1>=n){ok=1;break;}}if(ok==0){printf("-1\n");return 0;}for(register int i=1;i<=c&&n>0;++i){v[0]=i;if(i%2==1)backforward(1,k-1,c);else backback(1,k-1,c);}}} ^ user.cpp:3:965: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result] using namespace std;const int MOD=666013;int v[200005],n;struct culoare{int c,ans;};culoare vop[200005];int bsst(int st,int dr,int x){int med,last;while(st<=dr){med=(st+dr)/2;if(vop[med].c==x)last=med;if(vop[med].c>=x)dr=med-1;else st=med+1;}return last;}bool cmp(culoare a,culoare b){return a.c<b.c;}void afis(int k){for(int i=0;i<=k;i++)printf("%d ",v[i]);printf("\n");}void backforward(int poz,int k,int c){if(n==0)return;if(poz==k+1){afis(k);n--;}else for(int i=1;i<=c;i++){v[poz]=i;backforward(poz+1,k,c);}}void backback(int poz,int k,int c){if(n==0)return;if(poz==k+1){afis(k);n--;}else for(int i=c;i>=1;i--){v[poz]=i;backback(poz+1,k,c);}}int main(){freopen("procol.in","r",stdin);freopen("procol.out","w",stdout);int op;scanf("%d",&op);if(op==1){int nr=0,k,c,x,maxim,poz;scanf("%d%d%d",&n,&k,&c);for(register int i=1;i<=n;++i)for(register int j=1;j<=k;++j){scanf("%d",&x);vop[++nr].c=x;}sort(vop+1,vop+nr+1,cmp);fclose(stdin);freopen("procol.in","r",stdin);freopen("procol.out","w",stdout);scanf("%d%d%d%d",&op,&n,&k,&c);for(int i=1;i<=n;i++){maxim=0;for(int j=1;j<=k;j++){scanf("%d",&v[j]);poz=bsst(1,n*k,v[j]);if(vop[poz].ans+1>maxim)maxim=vop[poz].ans+1;}for(int j=1;j<=k;j++){poz=bsst(1,n*k,v[j]);vop[poz].ans=maxim;}}maxim=0;for(int j=1;j<=n*k;j++)if(vop[j].ans>maxim)maxim=vop[j].ans;printf("%d\n",maxim);}else if(op==2){int k,c,ap;scanf("%d%d",&k,&c);for(int i=1;i<=k;i++)scanf("%d",&v[i]);sort(v+1,v+k+1);ap=0;for(int i=1;i<=k;i++)if(v[i]!=v[i-1])++ap;long long ans1=1;for(int i=1;i<=k;i++)ans1=((1LL)*ans1*c)%MOD;long long ans2=1;for(int i=1;i<=k;i++)ans2=((1LL)*ans2*(c-ap))%MOD;printf("%lld\n",(MOD+ans1-ans2)%MOD);}else if(op==3){int k,c;scanf("%d%d%d",&n,&k,&c);long long rez1=1;bool ok=0;for(register int i=1;i<=k;++i){rez1=(1LL)*rez1*c;if(rez1>=n){ok=1;break;}}if(ok==0){printf("-1\n");return 0;}for(register int i=1;i<=c&&n>0;++i){v[0]=i;if(i%2==1)backforward(1,k-1,c);else backback(1,k-1,c);}}} ^ user.cpp:3:998: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result] using namespace std;const int MOD=666013;int v[200005],n;struct culoare{int c,ans;};culoare vop[200005];int bsst(int st,int dr,int x){int med,last;while(st<=dr){med=(st+dr)/2;if(vop[med].c==x)last=med;if(vop[med].c>=x)dr=med-1;else st=med+1;}return last;}bool cmp(culoare a,culoare b){return a.c<b.c;}void afis(int k){for(int i=0;i<=k;i++)printf("%d ",v[i]);printf("\n");}void backforward(int poz,int k,int c){if(n==0)return;if(poz==k+1){afis(k);n--;}else for(int i=1;i<=c;i++){v[poz]=i;backforward(poz+1,k,c);}}void backback(int poz,int k,int c){if(n==0)return;if(poz==k+1){afis(k);n--;}else for(int i=c;i>=1;i--){v[poz]=i;backback(poz+1,k,c);}}int main(){freopen("procol.in","r",stdin);freopen("procol.out","w",stdout);int op;scanf("%d",&op);if(op==1){int nr=0,k,c,x,maxim,poz;scanf("%d%d%d",&n,&k,&c);for(register int i=1;i<=n;++i)for(register int j=1;j<=k;++j){scanf("%d",&x);vop[++nr].c=x;}sort(vop+1,vop+nr+1,cmp);fclose(stdin);freopen("procol.in","r",stdin);freopen("procol.out","w",stdout);scanf("%d%d%d%d",&op,&n,&k,&c);for(int i=1;i<=n;i++){maxim=0;for(int j=1;j<=k;j++){scanf("%d",&v[j]);poz=bsst(1,n*k,v[j]);if(vop[poz].ans+1>maxim)maxim=vop[poz].ans+1;}for(int j=1;j<=k;j++){poz=bsst(1,n*k,v[j]);vop[poz].ans=maxim;}}maxim=0;for(int j=1;j<=n*k;j++)if(vop[j].ans>maxim)maxim=vop[j].ans;printf("%d\n",maxim);}else if(op==2){int k,c,ap;scanf("%d%d",&k,&c);for(int i=1;i<=k;i++)scanf("%d",&v[i]);sort(v+1,v+k+1);ap=0;for(int i=1;i<=k;i++)if(v[i]!=v[i-1])++ap;long long ans1=1;for(int i=1;i<=k;i++)ans1=((1LL)*ans1*c)%MOD;long long ans2=1;for(int i=1;i<=k;i++)ans2=((1LL)*ans2*(c-ap))%MOD;printf("%lld\n",(MOD+ans1-ans2)%MOD);}else if(op==3){int k,c;scanf("%d%d%d",&n,&k,&c);long long rez1=1;bool ok=0;for(register int i=1;i<=k;++i){rez1=(1LL)*rez1*c;if(rez1>=n){ok=1;break;}}if(ok==0){printf("-1\n");return 0;}for(register int i=1;i<=c&&n>0;++i){v[0]=i;if(i%2==1)backforward(1,k-1,c);else backback(1,k-1,c);}}} ^ user.cpp:3:1029: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] using namespace std;const int MOD=666013;int v[200005],n;struct culoare{int c,ans;};culoare vop[200005];int bsst(int st,int dr,int x){int med,last;while(st<=dr){med=(st+dr)/2;if(vop[med].c==x)last=med;if(vop[med].c>=x)dr=med-1;else st=med+1;}return last;}bool cmp(culoare a,culoare b){return a.c<b.c;}void afis(int k){for(int i=0;i<=k;i++)printf("%d ",v[i]);printf("\n");}void backforward(int poz,int k,int c){if(n==0)return;if(poz==k+1){afis(k);n--;}else for(int i=1;i<=c;i++){v[poz]=i;backforward(poz+1,k,c);}}void backback(int poz,int k,int c){if(n==0)return;if(poz==k+1){afis(k);n--;}else for(int i=c;i>=1;i--){v[poz]=i;backback(poz+1,k,c);}}int main(){freopen("procol.in","r",stdin);freopen("procol.out","w",stdout);int op;scanf("%d",&op);if(op==1){int nr=0,k,c,x,maxim,poz;scanf("%d%d%d",&n,&k,&c);for(register int i=1;i<=n;++i)for(register int j=1;j<=k;++j){scanf("%d",&x);vop[++nr].c=x;}sort(vop+1,vop+nr+1,cmp);fclose(stdin);freopen("procol.in","r",stdin);freopen("procol.out","w",stdout);scanf("%d%d%d%d",&op,&n,&k,&c);for(int i=1;i<=n;i++){maxim=0;for(int j=1;j<=k;j++){scanf("%d",&v[j]);poz=bsst(1,n*k,v[j]);if(vop[poz].ans+1>maxim)maxim=vop[poz].ans+1;}for(int j=1;j<=k;j++){poz=bsst(1,n*k,v[j]);vop[poz].ans=maxim;}}maxim=0;for(int j=1;j<=n*k;j++)if(vop[j].ans>maxim)maxim=vop[j].ans;printf("%d\n",maxim);}else if(op==2){int k,c,ap;scanf("%d%d",&k,&c);for(int i=1;i<=k;i++)scanf("%d",&v[i]);sort(v+1,v+k+1);ap=0;for(int i=1;i<=k;i++)if(v[i]!=v[i-1])++ap;long long ans1=1;for(int i=1;i<=k;i++)ans1=((1LL)*ans1*c)%MOD;long long ans2=1;for(int i=1;i<=k;i++)ans2=((1LL)*ans2*(c-ap))%MOD;printf("%lld\n",(MOD+ans1-ans2)%MOD);}else if(op==3){int k,c;scanf("%d%d%d",&n,&k,&c);long long rez1=1;bool ok=0;for(register int i=1;i<=k;++i){rez1=(1LL)*rez1*c;if(rez1>=n){ok=1;break;}}if(ok==0){printf("-1\n");return 0;}for(register int i=1;i<=c&&n>0;++i){v[0]=i;if(i%2==1)backforward(1,k-1,c);else backback(1,k-1,c);}}} ^ user.cpp:3:1099: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] using namespace std;const int MOD=666013;int v[200005],n;struct culoare{int c,ans;};culoare vop[200005];int bsst(int st,int dr,int x){int med,last;while(st<=dr){med=(st+dr)/2;if(vop[med].c==x)last=med;if(vop[med].c>=x)dr=med-1;else st=med+1;}return last;}bool cmp(culoare a,culoare b){return a.c<b.c;}void afis(int k){for(int i=0;i<=k;i++)printf("%d ",v[i]);printf("\n");}void backforward(int poz,int k,int c){if(n==0)return;if(poz==k+1){afis(k);n--;}else for(int i=1;i<=c;i++){v[poz]=i;backforward(poz+1,k,c);}}void backback(int poz,int k,int c){if(n==0)return;if(poz==k+1){afis(k);n--;}else for(int i=c;i>=1;i--){v[poz]=i;backback(poz+1,k,c);}}int main(){freopen("procol.in","r",stdin);freopen("procol.out","w",stdout);int op;scanf("%d",&op);if(op==1){int nr=0,k,c,x,maxim,poz;scanf("%d%d%d",&n,&k,&c);for(register int i=1;i<=n;++i)for(register int j=1;j<=k;++j){scanf("%d",&x);vop[++nr].c=x;}sort(vop+1,vop+nr+1,cmp);fclose(stdin);freopen("procol.in","r",stdin);freopen("procol.out","w",stdout);scanf("%d%d%d%d",&op,&n,&k,&c);for(int i=1;i<=n;i++){maxim=0;for(int j=1;j<=k;j++){scanf("%d",&v[j]);poz=bsst(1,n*k,v[j]);if(vop[poz].ans+1>maxim)maxim=vop[poz].ans+1;}for(int j=1;j<=k;j++){poz=bsst(1,n*k,v[j]);vop[poz].ans=maxim;}}maxim=0;for(int j=1;j<=n*k;j++)if(vop[j].ans>maxim)maxim=vop[j].ans;printf("%d\n",maxim);}else if(op==2){int k,c,ap;scanf("%d%d",&k,&c);for(int i=1;i<=k;i++)scanf("%d",&v[i]);sort(v+1,v+k+1);ap=0;for(int i=1;i<=k;i++)if(v[i]!=v[i-1])++ap;long long ans1=1;for(int i=1;i<=k;i++)ans1=((1LL)*ans1*c)%MOD;long long ans2=1;for(int i=1;i<=k;i++)ans2=((1LL)*ans2*(c-ap))%MOD;printf("%lld\n",(MOD+ans1-ans2)%MOD);}else if(op==3){int k,c;scanf("%d%d%d",&n,&k,&c);long long rez1=1;bool ok=0;for(register int i=1;i<=k;++i){rez1=(1LL)*rez1*c;if(rez1>=n){ok=1;break;}}if(ok==0){printf("-1\n");return 0;}for(register int i=1;i<=c&&n>0;++i){v[0]=i;if(i%2==1)backforward(1,k-1,c);else backback(1,k-1,c);}}} ^ user.cpp:3:1366: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] using namespace std;const int MOD=666013;int v[200005],n;struct culoare{int c,ans;};culoare vop[200005];int bsst(int st,int dr,int x){int med,last;while(st<=dr){med=(st+dr)/2;if(vop[med].c==x)last=med;if(vop[med].c>=x)dr=med-1;else st=med+1;}return last;}bool cmp(culoare a,culoare b){return a.c<b.c;}void afis(int k){for(int i=0;i<=k;i++)printf("%d ",v[i]);printf("\n");}void backforward(int poz,int k,int c){if(n==0)return;if(poz==k+1){afis(k);n--;}else for(int i=1;i<=c;i++){v[poz]=i;backforward(poz+1,k,c);}}void backback(int poz,int k,int c){if(n==0)return;if(poz==k+1){afis(k);n--;}else for(int i=c;i>=1;i--){v[poz]=i;backback(poz+1,k,c);}}int main(){freopen("procol.in","r",stdin);freopen("procol.out","w",stdout);int op;scanf("%d",&op);if(op==1){int nr=0,k,c,x,maxim,poz;scanf("%d%d%d",&n,&k,&c);for(register int i=1;i<=n;++i)for(register int j=1;j<=k;++j){scanf("%d",&x);vop[++nr].c=x;}sort(vop+1,vop+nr+1,cmp);fclose(stdin);freopen("procol.in","r",stdin);freopen("procol.out","w",stdout);scanf("%d%d%d%d",&op,&n,&k,&c);for(int i=1;i<=n;i++){maxim=0;for(int j=1;j<=k;j++){scanf("%d",&v[j]);poz=bsst(1,n*k,v[j]);if(vop[poz].ans+1>maxim)maxim=vop[poz].ans+1;}for(int j=1;j<=k;j++){poz=bsst(1,n*k,v[j]);vop[poz].ans=maxim;}}maxim=0;for(int j=1;j<=n*k;j++)if(vop[j].ans>maxim)maxim=vop[j].ans;printf("%d\n",maxim);}else if(op==2){int k,c,ap;scanf("%d%d",&k,&c);for(int i=1;i<=k;i++)scanf("%d",&v[i]);sort(v+1,v+k+1);ap=0;for(int i=1;i<=k;i++)if(v[i]!=v[i-1])++ap;long long ans1=1;for(int i=1;i<=k;i++)ans1=((1LL)*ans1*c)%MOD;long long ans2=1;for(int i=1;i<=k;i++)ans2=((1LL)*ans2*(c-ap))%MOD;printf("%lld\n",(MOD+ans1-ans2)%MOD);}else if(op==3){int k,c;scanf("%d%d%d",&n,&k,&c);long long rez1=1;bool ok=0;for(register int i=1;i<=k;++i){rez1=(1LL)*rez1*c;if(rez1>=n){ok=1;break;}}if(ok==0){printf("-1\n");return 0;}for(register int i=1;i<=c&&n>0;++i){v[0]=i;if(i%2==1)backforward(1,k-1,c);else backback(1,k-1,c);}}} ^ user.cpp:3:1405: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] using namespace std;const int MOD=666013;int v[200005],n;struct culoare{int c,ans;};culoare vop[200005];int bsst(int st,int dr,int x){int med,last;while(st<=dr){med=(st+dr)/2;if(vop[med].c==x)last=med;if(vop[med].c>=x)dr=med-1;else st=med+1;}return last;}bool cmp(culoare a,culoare b){return a.c<b.c;}void afis(int k){for(int i=0;i<=k;i++)printf("%d ",v[i]);printf("\n");}void backforward(int poz,int k,int c){if(n==0)return;if(poz==k+1){afis(k);n--;}else for(int i=1;i<=c;i++){v[poz]=i;backforward(poz+1,k,c);}}void backback(int poz,int k,int c){if(n==0)return;if(poz==k+1){afis(k);n--;}else for(int i=c;i>=1;i--){v[poz]=i;backback(poz+1,k,c);}}int main(){freopen("procol.in","r",stdin);freopen("procol.out","w",stdout);int op;scanf("%d",&op);if(op==1){int nr=0,k,c,x,maxim,poz;scanf("%d%d%d",&n,&k,&c);for(register int i=1;i<=n;++i)for(register int j=1;j<=k;++j){scanf("%d",&x);vop[++nr].c=x;}sort(vop+1,vop+nr+1,cmp);fclose(stdin);freopen("procol.in","r",stdin);freopen("procol.out","w",stdout);scanf("%d%d%d%d",&op,&n,&k,&c);for(int i=1;i<=n;i++){maxim=0;for(int j=1;j<=k;j++){scanf("%d",&v[j]);poz=bsst(1,n*k,v[j]);if(vop[poz].ans+1>maxim)maxim=vop[poz].ans+1;}for(int j=1;j<=k;j++){poz=bsst(1,n*k,v[j]);vop[poz].ans=maxim;}}maxim=0;for(int j=1;j<=n*k;j++)if(vop[j].ans>maxim)maxim=vop[j].ans;printf("%d\n",maxim);}else if(op==2){int k,c,ap;scanf("%d%d",&k,&c);for(int i=1;i<=k;i++)scanf("%d",&v[i]);sort(v+1,v+k+1);ap=0;for(int i=1;i<=k;i++)if(v[i]!=v[i-1])++ap;long long ans1=1;for(int i=1;i<=k;i++)ans1=((1LL)*ans1*c)%MOD;long long ans2=1;for(int i=1;i<=k;i++)ans2=((1LL)*ans2*(c-ap))%MOD;printf("%lld\n",(MOD+ans1-ans2)%MOD);}else if(op==3){int k,c;scanf("%d%d%d",&n,&k,&c);long long rez1=1;bool ok=0;for(register int i=1;i<=k;++i){rez1=(1LL)*rez1*c;if(rez1>=n){ok=1;break;}}if(ok==0){printf("-1\n");return 0;}for(register int i=1;i<=c&&n>0;++i){v[0]=i;if(i%2==1)backforward(1,k-1,c);else backback(1,k-1,c);}}} ^ user.cpp:3:1683: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] using namespace std;const int MOD=666013;int v[200005],n;struct culoare{int c,ans;};culoare vop[200005];int bsst(int st,int dr,int x){int med,last;while(st<=dr){med=(st+dr)/2;if(vop[med].c==x)last=med;if(vop[med].c>=x)dr=med-1;else st=med+1;}return last;}bool cmp(culoare a,culoare b){return a.c<b.c;}void afis(int k){for(int i=0;i<=k;i++)printf("%d ",v[i]);printf("\n");}void backforward(int poz,int k,int c){if(n==0)return;if(poz==k+1){afis(k);n--;}else for(int i=1;i<=c;i++){v[poz]=i;backforward(poz+1,k,c);}}void backback(int poz,int k,int c){if(n==0)return;if(poz==k+1){afis(k);n--;}else for(int i=c;i>=1;i--){v[poz]=i;backback(poz+1,k,c);}}int main(){freopen("procol.in","r",stdin);freopen("procol.out","w",stdout);int op;scanf("%d",&op);if(op==1){int nr=0,k,c,x,maxim,poz;scanf("%d%d%d",&n,&k,&c);for(register int i=1;i<=n;++i)for(register int j=1;j<=k;++j){scanf("%d",&x);vop[++nr].c=x;}sort(vop+1,vop+nr+1,cmp);fclose(stdin);freopen("procol.in","r",stdin);freopen("procol.out","w",stdout);scanf("%d%d%d%d",&op,&n,&k,&c);for(int i=1;i<=n;i++){maxim=0;for(int j=1;j<=k;j++){scanf("%d",&v[j]);poz=bsst(1,n*k,v[j]);if(vop[poz].ans+1>maxim)maxim=vop[poz].ans+1;}for(int j=1;j<=k;j++){poz=bsst(1,n*k,v[j]);vop[poz].ans=maxim;}}maxim=0;for(int j=1;j<=n*k;j++)if(vop[j].ans>maxim)maxim=vop[j].ans;printf("%d\n",maxim);}else if(op==2){int k,c,ap;scanf("%d%d",&k,&c);for(int i=1;i<=k;i++)scanf("%d",&v[i]);sort(v+1,v+k+1);ap=0;for(int i=1;i<=k;i++)if(v[i]!=v[i-1])++ap;long long ans1=1;for(int i=1;i<=k;i++)ans1=((1LL)*ans1*c)%MOD;long long ans2=1;for(int i=1;i<=k;i++)ans2=((1LL)*ans2*(c-ap))%MOD;printf("%lld\n",(MOD+ans1-ans2)%MOD);}else if(op==3){int k,c;scanf("%d%d%d",&n,&k,&c);long long rez1=1;bool ok=0;for(register int i=1;i<=k;++i){rez1=(1LL)*rez1*c;if(rez1>=n){ok=1;break;}}if(ok==0){printf("-1\n");return 0;}for(register int i=1;i<=c&&n>0;++i){v[0]=i;if(i%2==1)backforward(1,k-1,c);else backback(1,k-1,c);}}} ^ user.cpp: In function ‘int bsst(int, int, int)’: user.cpp:3:250: warning: ‘last’ may be used uninitialized in this function [-Wmaybe-uninitialized] using namespace std;const int MOD=666013;int v[200005],n;struct culoare{int c,ans;};culoare vop[200005];int bsst(int st,int dr,int x){int med,last;while(st<=dr){med=(st+dr)/2;if(vop[med].c==x)last=med;if(vop[med].c>=x)dr=med-1;else st=med+1;}return last;}bool cmp(culoare a,culoare b){return a.c<b.c;}void afis(int k){for(int i=0;i<=k;i++)printf("%d ",v[i]);printf("\n");}void backforward(int poz,int k,int c){if(n==0)return;if(poz==k+1){afis(k);n--;}else for(int i=1;i<=c;i++){v[poz]=i;backforward(poz+1,k,c);}}void backback(int poz,int k,int c){if(n==0)return;if(poz==k+1){afis(k);n--;}else for(int i=c;i>=1;i--){v[poz]=i;backback(poz+1,k,c);}}int main(){freopen("procol.in","r",stdin);freopen("procol.out","w",stdout);int op;scanf("%d",&op);if(op==1){int nr=0,k,c,x,maxim,poz;scanf("%d%d%d",&n,&k,&c);for(register int i=1;i<=n;++i)for(register int j=1;j<=k;++j){scanf("%d",&x);vop[++nr].c=x;}sort(vop+1,vop+nr+1,cmp);fclose(stdin);freopen("procol.in","r",stdin);freopen("procol.out","w",stdout);scanf("%d%d%d%d",&op,&n,&k,&c);for(int i=1;i<=n;i++){maxim=0;for(int j=1;j<=k;j++){scanf("%d",&v[j]);poz=bsst(1,n*k,v[j]);if(vop[poz].ans+1>maxim)maxim=vop[poz].ans+1;}for(int j=1;j<=k;j++){poz=bsst(1,n*k,v[j]);vop[poz].ans=maxim;}}maxim=0;for(int j=1;j<=n*k;j++)if(vop[j].ans>maxim)maxim=vop[j].ans;printf("%d\n",maxim);}else if(op==2){int k,c,ap;scanf("%d%d",&k,&c);for(int i=1;i<=k;i++)scanf("%d",&v[i]);sort(v+1,v+k+1);ap=0;for(int i=1;i<=k;i++)if(v[i]!=v[i-1])++ap;long long ans1=1;for(int i=1;i<=k;i++)ans1=((1LL)*ans1*c)%MOD;long long ans2=1;for(int i=1;i<=k;i++)ans2=((1LL)*ans2*(c-ap))%MOD;printf("%lld\n",(MOD+ans1-ans2)%MOD);}else if(op==3){int k,c;scanf("%d%d%d",&n,&k,&c);long long rez1=1;bool ok=0;for(register int i=1;i<=k;++i){rez1=(1LL)*rez1*c;if(rez1>=n){ok=1;break;}}if(ok==0){printf("-1\n");return 0;}for(register int i=1;i<=c&&n>0;++i){v[0]=i;if(i%2==1)backforward(1,k-1,c);else backback(1,k-1,c);}}} ^ user.cpp: In function ‘int main()’: user.cpp:3:1228: warning: ‘last’ may be used uninitialized in this function [-Wmaybe-uninitialized] using namespace std;const int MOD=666013;int v[200005],n;struct culoare{int c,ans;};culoare vop[200005];int bsst(int st,int dr,int x){int med,last;while(st<=dr){med=(st+dr)/2;if(vop[med].c==x)last=med;if(vop[med].c>=x)dr=med-1;else st=med+1;}return last;}bool cmp(culoare a,culoare b){return a.c<b.c;}void afis(int k){for(int i=0;i<=k;i++)printf("%d ",v[i]);printf("\n");}void backforward(int poz,int k,int c){if(n==0)return;if(poz==k+1){afis(k);n--;}else for(int i=1;i<=c;i++){v[poz]=i;backforward(poz+1,k,c);}}void backback(int poz,int k,int c){if(n==0)return;if(poz==k+1){afis(k);n--;}else for(int i=c;i>=1;i--){v[poz]=i;backback(poz+1,k,c);}}int main(){freopen("procol.in","r",stdin);freopen("procol.out","w",stdout);int op;scanf("%d",&op);if(op==1){int nr=0,k,c,x,maxim,poz;scanf("%d%d%d",&n,&k,&c);for(register int i=1;i<=n;++i)for(register int j=1;j<=k;++j){scanf("%d",&x);vop[++nr].c=x;}sort(vop+1,vop+nr+1,cmp);fclose(stdin);freopen("procol.in","r",stdin);freopen("procol.out","w",stdout);scanf("%d%d%d%d",&op,&n,&k,&c);for(int i=1;i<=n;i++){maxim=0;for(int j=1;j<=k;j++){scanf("%d",&v[j]);poz=bsst(1,n*k,v[j]);if(vop[poz].ans+1>maxim)maxim=vop[poz].ans+1;}for(int j=1;j<=k;j++){poz=bsst(1,n*k,v[j]);vop[poz].ans=maxim;}}maxim=0;for(int j=1;j<=n*k;j++)if(vop[j].ans>maxim)maxim=vop[j].ans;printf("%d\n",maxim);}else if(op==2){int k,c,ap;scanf("%d%d",&k,&c);for(int i=1;i<=k;i++)scanf("%d",&v[i]);sort(v+1,v+k+1);ap=0;for(int i=1;i<=k;i++)if(v[i]!=v[i-1])++ap;long long ans1=1;for(int i=1;i<=k;i++)ans1=((1LL)*ans1*c)%MOD;long long ans2=1;for(int i=1;i<=k;i++)ans2=((1LL)*ans2*(c-ap))%MOD;printf("%lld\n",(MOD+ans1-ans2)%MOD);}else if(op==3){int k,c;scanf("%d%d%d",&n,&k,&c);long long rez1=1;bool ok=0;for(register int i=1;i<=k;++i){rez1=(1LL)*rez1*c;if(rez1>=n){ok=1;break;}}if(ok==0){printf("-1\n");return 0;}for(register int i=1;i<=c&&n>0;++i){v[0]=i;if(i%2==1)backforward(1,k-1,c);else backback(1,k-1,c);}}} ^ user.cpp:3:1138: warning: ‘last’ may be used uninitialized in this function [-Wmaybe-uninitialized] using namespace std;const int MOD=666013;int v[200005],n;struct culoare{int c,ans;};culoare vop[200005];int bsst(int st,int dr,int x){int med,last;while(st<=dr){med=(st+dr)/2;if(vop[med].c==x)last=med;if(vop[med].c>=x)dr=med-1;else st=med+1;}return last;}bool cmp(culoare a,culoare b){return a.c<b.c;}void afis(int k){for(int i=0;i<=k;i++)printf("%d ",v[i]);printf("\n");}void backforward(int poz,int k,int c){if(n==0)return;if(poz==k+1){afis(k);n--;}else for(int i=1;i<=c;i++){v[poz]=i;backforward(poz+1,k,c);}}void backback(int poz,int k,int c){if(n==0)return;if(poz==k+1){afis(k);n--;}else for(int i=c;i>=1;i--){v[poz]=i;backback(poz+1,k,c);}}int main(){freopen("procol.in","r",stdin);freopen("procol.out","w",stdout);int op;scanf("%d",&op);if(op==1){int nr=0,k,c,x,maxim,poz;scanf("%d%d%d",&n,&k,&c);for(register int i=1;i<=n;++i)for(register int j=1;j<=k;++j){scanf("%d",&x);vop[++nr].c=x;}sort(vop+1,vop+nr+1,cmp);fclose(stdin);freopen("procol.in","r",stdin);freopen("procol.out","w",stdout);scanf("%d%d%d%d",&op,&n,&k,&c);for(int i=1;i<=n;i++){maxim=0;for(int j=1;j<=k;j++){scanf("%d",&v[j]);poz=bsst(1,n*k,v[j]);if(vop[poz].ans+1>maxim)maxim=vop[poz].ans+1;}for(int j=1;j<=k;j++){poz=bsst(1,n*k,v[j]);vop[poz].ans=maxim;}}maxim=0;for(int j=1;j<=n*k;j++)if(vop[j].ans>maxim)maxim=vop[j].ans;printf("%d\n",maxim);}else if(op==2){int k,c,ap;scanf("%d%d",&k,&c);for(int i=1;i<=k;i++)scanf("%d",&v[i]);sort(v+1,v+k+1);ap=0;for(int i=1;i<=k;i++)if(v[i]!=v[i-1])++ap;long long ans1=1;for(int i=1;i<=k;i++)ans1=((1LL)*ans1*c)%MOD;long long ans2=1;for(int i=1;i<=k;i++)ans2=((1LL)*ans2*(c-ap))%MOD;printf("%lld\n",(MOD+ans1-ans2)%MOD);}else if(op==3){int k,c;scanf("%d%d%d",&n,&k,&c);long long rez1=1;bool ok=0;for(register int i=1;i<=k;++i){rez1=(1LL)*rez1*c;if(rez1>=n){ok=1;break;}}if(ok==0){printf("-1\n");return 0;}for(register int i=1;i<=c&&n>0;++i){v[0]=i;if(i%2==1)backforward(1,k-1,c);else backback(1,k-1,c);}}} ^