//#include <bits/stdc++.h>
#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <functional>
#include <map>
#include <iomanip>
#include <math.h> 
#include <stack>
#include <queue>
#include <bitset>
#include <cstdlib>
#include <tuple>
#include <cctype>
#include <ctype.h>
#include <set>
#include <sstream>
using namespace std;
#define int long long
#define rep(i,s,n) for(int i = s;i<n;i++)
#define repe(i,s,n) for(int i = s;i<=n;i++)
#define rrep(i,s,n) for(int i = (n)-1;i>=(s);i--)
#define all(v) (v).begin(),(v).end()
#define pb push_back
#define fi first
#define se second
#define chmin(a,b) a=min((a),(b))
#define chmax(a,b) a=max((a),(b))
typedef long long ll;
typedef pair<int, int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
typedef pair<pint, int> P1;
typedef pair<int, pint> P2;
typedef pair<pint, pint> PP;
static const ll maxLL = (ll)1 << 62;
const ll MOD = 1000000007;
const ll INF = 1e18;
int ca[12] = { 31,28,31,30,31,30,31,31,30,31,30,31 };


signed main() {
	int i, j;
	string s;
	int n, m, a, b, cnt = 0;

	cin >> a >> b;

	vint lista, listb;
	
	while (true)
	{
		bool flag = false;

		rep(i, 2, 100) {
			if (a%i == 0) {
				lista.pb(i);
				a /= i;
				flag = true;
				break;
			}
		}

		if (flag == false) break;
	}


	while (true)
	{
		bool flag = false;

		rep(i, 2, 100) {
			if (b%i == 0) {
				listb.pb(i);
				b /= i;
				flag = true;
				break;
			}
		}
		if (flag == false) break;
	}

	ll ans = a*b;

	rep(i, 0, lista.size()) {
		ans *= lista[i];
		ans %= 1000000007;
	}

	rep(j, 0, listb.size()) {
		ans *= listb[j];
		ans %= 1000000007;
	}

	cout << ans % 1000000007 << endl;





	getchar();
	getchar();
	return 0;
}