#include<iostream>
#include<vector>
using namespace std;
int main()
{int m,n;cin>>m>>n;vector<int> v;for(int i=1; i<=m; i++){v.push_back(i);}int t=1;while(m>1){    t+=n-1;t=!(t%m)?m:t%m;v.erase(v.begin()+t-1);    //删除当前vector中第t个元素m--;}cout<<v[0]<<endl;return 0;
}

#include<iostream>
#include<vector>
using namespace std;
int main()
{int m,n;cin>>m>>n;vector<int> v;for(int i=1; i<=m; i++){v.push_back(i);}int t=1;while(v.size()>1){    t+=n-1;t=!(t%v.size())?v.size():t%v.size();v.erase(v.begin()+t-1);    //删除当前vector中第t个元素
    }cout<<v[0]<<endl;return 0;
}

#include<stdio.h>
#define Maxsize 100
double max_min(int i, int* a)
{int m, n, r;int *p, *q;double s = 0, min, max, maxmin;for (m = 2; m <= i; m++)  //子列长度
    {p = a;    //子列首元素指针q = a;for (n = 1; n <= i - m + 1; n++)   //子列起始位置
        {            for (r = 1; r < m; r++)     {q++;max = (double)*p;min = (double)*p;if (max<*q)max = *q;if (min>*q)min = *q;                }    p++;q = p;maxmin = max - min; s += maxmin;}}return s;
}int main()
{int i, j;double s;int a[Maxsize];scanf("%d", &i);for (j = 0; j<i; j++){scanf("%d", &a[j]);}s = max_min(i, a);printf("s=%lf\n", s);    return 0;
}

//约瑟夫问题dp优化
#include<iostream>
using namespace std;
int k;int fun(int n){if(n == 1)return 0;else if(n <= k)return (fun(n - 1) + k) % n;else{if(fun(n - n / k) < n % k)return n - n % k + fun(n - n / k); elsereturn fun(n - n / k) - n % k + (fun(n - n / k) - n % k) / (k - 1);}
}int main(){int T, N;cin >> T;while(T--){cin >> N >> k;cout << fun(N) << endl;}    return 0;
}