#include<stdio.h>
#include<stdlib.h>
typedef struct {/*定義順序表的存儲結(jié)構(gòu)*/
	int *data;
	int length;
}sqlist;
void main(){
	sqlist L;
	int n,m,s,k,i,j,pos,time;
	FILE *fp;
	fp=fopen("aa.txt","r");/*從文件中讀入相關(guān)數(shù)據(jù)*/
    fscanf(fp,"%d",&k);
	for(j=1;j<=k;j++){
		fscanf(fp,"%d%d%d",&n,&s,&m);
	    L.data=(int*)malloc(sizeof(int)*n);/*解決約瑟夫環(huán)問題的具體算法*/
	    for(i=0;i<n;i++)
		   L.data[i]=i+1;
	    L.length=n;
	    for(i=0;i<L.length;i++) /*打印出隊列中所有元素*/
		    printf("%d",L.data[i]);
	    printf("\n");
	    if(n<s) printf("n less then s\n");
	    pos=s;
	    for(time=1;time<n;time++){/*解決出隊元素和出隊后的隊列的算法*/
		    pos=pos+m-1;
		    while(pos>L.length)
			    pos=pos-L.length;
	    	printf("出隊元素為：%d \n",L.data[pos-1]);
		    for(i=pos-1;i<=L.length-1;i++)
			    L.data[i]=L.data[i+1];
		    L.length--;
		    printf("第%d次出列后：\n",time);
		    for(i=0;i<L.length;i++)
			    printf("%d",L.data[i]);
		    printf("\n");
		}
	    printf("%d\n",L.data[0]);
	}
}