int gcd(int m, int n) {
	while (m != n) {
		m = abs(m - n);
		n = abs(m - n); 
	}
	return m;
}
int main() {
	long long n, k, a[100005] = {0}, cnt = 1;
	cin >> n >> k;
	for (int i = 1; i <= n; i++)
		if (gcd(i, n) == 1) {
			a[cnt] = i;
			cnt++;
		}
	cnt -= 1;	
	if (k % cnt == 0)
		cout << k / cnt * n - 1 << endl;
	else
		cout << k / cnt * n + a[k % cnt] << endl;