#include<stdlib.h>
#include<stdio.h>
//#用數(shù)組索引的模式 
int main(){
	int m;
	printf("請(qǐng)輸入m的值：");
	scanf("%d",&m);
	int n;
	printf("請(qǐng)輸入n的值:"); 
	scanf("%d",&n);
	int a[100];
	for(int i = 0;i<n;i++){
		scanf("%d",&a[i]);
	}
	int cnt = 0;
	int cnt1 = 0;
	int i = 0;
	while(1){
		if (a[i]!=0){
			cnt++;
			if(cnt==m){
				m = a[i];
				a[i] = 0;
				cnt = 0;
				printf("%d ",i+1);
				cnt1++;
			}
			if(cnt1==n){
				break;
			}
		}
		i = (++i)%n;
	} 
}

#include<stdlib.h>
#include<stdio.h>
//用單項(xiàng)循環(huán)列表的方式 
//數(shù)據(jù)類型的定義 
typedef struct LNode{
	int data;		//定義密碼值 
	int index; 		//定義數(shù)據(jù)的下標(biāo) 
	struct LNode *next;
}LNode,*LinkList;
int GetElem_L(LinkList L,int i ,int &e){
	LNode* p;				//注意這里的*號(hào) 
	p = L->next;
	int j = 1;
	while(p&&j<i){
		p = p->next;
		++j;
	} 
	if(!p || j>i)
	{
		return -1;
	}
	e = p->data;
//	printf("%d ",e);
	return e;
}//GetElem_L
int GetIndex_L(LinkList L,int i ,int &e){
	LNode* p;				//注意這里的*號(hào) 
	p = L->next;
	int j = 1;
	while(p&&j<i){
		p = p->next;
		++j;
	} 
	if(!p || j>i)
	{
		return -1;
	}
	e = p->index;
//	printf("%d ",e);
	return e;
}//GetIndex_L
int ListDelete_L(LinkList &L,int i,int &e){
	LNode* p;				//注意這里的*號(hào)
	p  = L;
	int j = 0;
	while(p->next&&j<i-1){
		p = p->next;
		++j;
	}
	if(!(p->next)||j>i-1){
		return -1;
	}
	LNode* q;
	q = p->next;
	p->next = q->next;
	e = q->data;
	free(q);
	return e; 
}//ListDelete_L
void CreateList_L(LinkList &L,int n){
	L = (LinkList)malloc(sizeof(LNode));
	L->next = NULL;
	LNode* tmp = (LinkList)malloc(sizeof(LNode));
	tmp = L;
	for(int i = 0;i<n-1;++i){
		LNode* p = (LinkList)malloc(sizeof(LNode));
		scanf("%d",&p->data);
		p->index = i+1;
		p->next = tmp->next;
		tmp->next = p;
		tmp = tmp->next;
	}
	LNode* p = (LinkList)malloc(sizeof(LNode));          //注意這里的*號(hào)
	scanf("%d",&p->data);
	p->index = n;
	p->next = L->next;
	tmp->next = p;
}//創(chuàng)建循環(huán)鏈表 
int main(){
	int m;
	int cnt;
	printf("請(qǐng)輸入m的值：");
	scanf("%d",&m);
	int n;
	printf("請(qǐng)輸入n的值: "); 
	scanf("%d",&n);
	LNode* L;						//注意這里的*號(hào)
	CreateList_L(L,n);	
	int e = 0 ;
	int index = 0;
	for(int i = 0;i<n;i++){
		GetElem_L(L,i+1,e);
	}
	for(int i = 0;i<n;i++){
		int l = 0;
		l = GetIndex_L(L,m,index);
		printf("%d ",l);
		int tmp = GetElem_L(L,m,e);
		for(int i = 0;i<m-1;i++){		
			L = L->next;
		}
		ListDelete_L(L,1,e);
		m =  tmp;
	}
}