#include <bits/stdc++.h>

using namespace std;

using pii = pair<int, int>;
using ll = long long;
const int N = 2000010, MOD = 998244353, INF = 0x3f3f3f3f;
int n, m, w[N];


void solve() {
    int a, b;
    cin >> a >> b;
    for (int i = 1; ; i++)
        if (i % a == b % i) {
            printf("%d\n", i);
            return;
        }
}

int main() {
    int T = 1;
    // cin >> T;
    while (T--) solve();
    return 0;
}