#include<stdio.h>
int main(){
	int n,m,p,left,right;
	int sum;
	int num[50010];
	while(~scanf("%d%d%d%d%d",&n,&m,&p,&left,&right)){
		sum=0;

		int kk=n/m;
		int th=1;
		th*=m;sum++;
		while(1){
			if(th==1)break;
			if(th<=kk){th*=m;sum++;}
			else {th=(th-kk-1)/(m-1)+th-kk;sum++;}
		}
	//	printf("xuanhuan==%d\n",sum);
		p%=sum;
		for(int i=1;i<=n;i++){
			int my=i;
			for(int j=1;j<=p;j++){
				if(my<=kk){my*=m;}
				else {my=(my-kk-1)/(m-1)+my-kk;}
			}
	//		printf("%d\n",my);
			num[my]=i;
		}

		for(int ll=left;ll<=right;ll++)
		{
			if(ll==left)printf("%d",num[ll]);
			else printf(" %d",num[ll]);
		}
		printf("\n");

	}
	return 0;

}

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章:

  • 2021-11-12
  • 2021-06-08
  • 2021-12-03
  • 2022-02-27
  • 2022-02-06
  • 2021-06-03
猜你喜欢
  • 2021-12-11
  • 2021-09-16
  • 2021-06-23
  • 2021-11-27
  • 2021-07-14
  • 2022-02-02
  • 2022-12-23
相关资源
相似解决方案