#include <iostream>
#include<vector>
#include<algorithm>

using namespace std;

long long int gcd(long long int a, long long int b)
{
    //cout << a << " " << b << endl;
    if (b == 0) {
        return a;
    }
    return gcd(b, a % b);
}

int main()
{
    long long int i = 0, j, n , m , diff;
    cin >> n >> m;
    if (m > n) {
        diff = m - n;
    }
    else {
         diff= n - m;
    }

    vector<long long int>V;

    for (i = 0; i <= diff; i++) {
        j = gcd(m, n);
        V.push_back((m / j) * (n / j));
        n++;
        m++;
    }

    cout << min_element(V.begin(), V.end()) - V.begin() << endl;

    return 0;
}