#include<stdio.h>
#include<malloc.h>
 
//創(chuàng)建結(jié)構(gòu)體 
typedef struct Node{
	int data;
	struct Node* next;
} NODE;
 
//創(chuàng)建新結(jié)點(diǎn)和插入結(jié)點(diǎn) 
void insert(NODE* head)
{
	int i;
	NODE* tail = head;
	
	//對(duì)每一個(gè)結(jié)點(diǎn)進(jìn)行編號(hào)，依次編號(hào)為1、2、3......13
	for(i = 2; i <= 13; i++)
	{
		NODE* newnode;
		newnode = (NODE*)malloc(sizeof(NODE));
		newnode->data = i;
		
		//尾插法連接鏈表 
		newnode->next = NULL; 
		tail->next =  newnode;
		tail = newnode;
	}
	
	/*
    這段語句用來打印鏈表，檢測鏈表是否正確連接的 
	NODE* pmove = head; 
	while(pmove != NULL)
	{
	  printf("%d->",pmove->data);
	  pmove = pmove->next;
    } 
    */ 
	 
	 tail->next = head; //將尾結(jié)點(diǎn)連接到頭結(jié)點(diǎn)上，形成一個(gè)環(huán) 
}
 
void serch(NODE* head)
{
	 int start_data,i,k;
    NODE* start = head;
	scanf("%d%d", &start_data, &k);
	
	//移動(dòng)到第start_data結(jié)點(diǎn)，并將此結(jié)點(diǎn)當(dāng)成1號(hào)結(jié)點(diǎn) 
	for(i = 2; i <= start_data; i++)
	{
		start = start -> next;
	}
	
	NODE* front; //front表示第k個(gè)結(jié)點(diǎn)的前一個(gè)結(jié)點(diǎn) 
	while(start->next != NULL)
	{
	  int j;
	  for(j = 2; j <= k; j++)
	  {
		front = start; //先讓front移動(dòng)到當(dāng)前結(jié)點(diǎn)，然后當(dāng)前結(jié)點(diǎn)往下移動(dòng)，就形成一前一后的效果 
		start = start->next; //移動(dòng)結(jié)點(diǎn) 
	  }
		
		front->next = start->next; //將第k個(gè)結(jié)點(diǎn)的上一個(gè)結(jié)點(diǎn)連接到它的下一個(gè)結(jié)點(diǎn)上 
		
		free(start);//刪除指定結(jié)點(diǎn)
		start = front->next;//更新start的位置，也就是1號(hào) 
		
		//當(dāng)?shù)趉個(gè)仍是本身，即只剩下了一個(gè)結(jié)點(diǎn),跳出循環(huán)
		if(start->data == (start->next)->data)
		 break;
	}	
	printf("%d",start->data);
}
 
int main()
{
   //創(chuàng)建鏈表 
	NODE* head;
	head = (NODE*)malloc(sizeof(NODE));
	head->data = 1;
	head->next = NULL;
	
	
	//創(chuàng)建新結(jié)點(diǎn)和連接結(jié)點(diǎn) 
    insert(head);
    
    //查找第k個(gè)結(jié)點(diǎn)并且將其刪除。 
    serch(head);
	return 0;
}