#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
using namespace std;
using P = pair<int, int>;

int main(){
    int l, r; cin >> l >> r;

    const int lim = 2000000;
    vector<int> isprime(lim);
    for(int i = 0; i < lim; i++) isprime[i] = i;
    for(int i = 2; i < lim; i++){
        if(isprime[i] != i) continue;
        for(int j = i+i; j < lim; j += i) isprime[j] = min(isprime[j], i);
    }
    
    vector<int> cnt(lim, 0);
    set<int> mem;
    {
        int x = l;
        while(x > 1){
            cnt[isprime[x]]++;
            mem.emplace(isprime[x]);
            x /= isprime[x];
        }
        for(int i = 0; i < lim; i++) cnt[i] *= l;
    }
    for(int i = l+1; i <= r; i++){
        int x = i;
        vector<int> facs;
        while(x > 1){
            int p = isprime[x];
            facs.emplace_back(p);
            mem.erase(p);
            int z = 0;
            while(x%p == 0){
                x /= p;
                z++;
            }
            cnt[p] = min(cnt[p], z*i);
        }
        for(auto &it: mem) cnt[it] = 0;
        mem.clear();
        for(auto &it: facs) mem.emplace(it);
    }
    long long ans = 1;
    for(auto &i: mem){
        for(int j = 0; j < cnt[i]; j++){
            ans *= i;
        }
    }
    cout << ans << endl;
    return 0;
}