AC

#include <cstdio>
#include <algorithm>
#include <queue>
using namespace std;
 int main()
 {
 	int n,m;
	scanf("%d%d",&n,&m);
	queue<int> myqueue;
	for(int j = 0; j < n; j++)
 	{
 		myqueue.push(j);
	}
	int num = 1;
	int cur = myqueue.front();
	while(true)
	{
		if(num == m)
	 	{
	 		cur = myqueue.front();
	 		myqueue.pop();
	 		if(myqueue.empty())
	 		{
	 			printf("%d",cur);
	 			break;
			}
		 	else
		 	{
		 		num++;
		 		if(num > m)
		 		{
		 			num = 1;
			 	}
			 	
		 	}
	 	}
	 	else
	 	{
	 		int x = myqueue.front();
	 		myqueue.pop();
	 		myqueue.push(x);
	 		num++;
	 		if(num > m)
			{
		 		num = 1;
			}
	 	}
	}
 	return 0;
 }