#include<bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
    int L,R; cin >> L >> R;
    vector<long long> fac(200010,1LL<<60), cnt(200010);

    for(int N = L; N <= R; N++) {
        int n = N;
        for(int i = 2; i*i <= N; i++) {
            if(n%i == 0) {
                ll ex = 0;
                cnt[i]++;
                while(n%i == 0) {
                    ex++;
                    n /= i;
                }
                fac[i] = min(fac[i],ex*N);
            }
        }
        if(n != 1) {
            cnt[n]++;
            fac[n] = min(fac[n],(ll)N);
        }
    }

    long long ans = 1;

    for(int i = 2; i < 200010; i++) {
        if(cnt[i] == R-L+1) {
            ans *= pow(i,fac[i]);
        }
    }

    cout << ans << endl;
}