#include <bits/stdc++.h>
#define int long long
using namespace std;
int n, m, f[2000006], b[2000006], sum[2000006], prime[2000006], ccnt, mo[2000006], ans, ssum[2000006];
const int mod = 1000000007;
inline int calc(int p, int q) {
	int cnt = 0;
	for (int l = 1, r; l <= min(p, q); l = r + 1) {
		r = min(p / (p / l), q / (q / l));
		r = min(r, min(p, q));
//		cout << l << '-' << r << "-" << p / l << "-" << q / l << ' ' << mo[r] - mo[l - 1] << "p[]\n";
		cnt = cnt + ((sum[r] - sum[l - 1] + mod) % mod) * (p / l) % mod * (q / l) % mod;
		cnt %= mod;
	}
	return cnt;
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m;
	f[1] = f[2] = 1;
	for (int i = 3; i <= max(n, m); i++) {
		f[i] = f[i - 1] + f[i - 2];
		f[i] %= mod;
	}
	mo[1] = 1;
	for (int i = 2; i <= max(n, m); i++) {
		if (!b[i]) {
			b[i] = i, prime[++ccnt] = i;
			mo[i] = -1;
		}
		for (int j = 1; j <= ccnt && i * prime[j] <= max(n, m); j++) {
			b[i * prime[j]] = prime[j];
			if (i % prime[j] == 0) {
				mo[i * prime[j]] = 0;
				break;
			} else {
				mo[i * prime[j]] = -mo[i];
			}
		}
	}
	for (int i = 1; i <= max(n, m); i++) {
		sum[i] = sum[i - 1] + mo[i];
		sum[i] = (sum[i] + mod) % mod;
	}
	for (int i = 1; i <= min(n, m); i++) {
		ssum[i] = (ssum[i - 1] + f[i]) % mod;
	}
	for (int l = 1, r; l <= min(n, m); l = r + 1) {
		r = min(n / (n / l), m / (m / l));
		r = min(r, min(n, m));
		ans = ans + (ssum[r] - ssum[l - 1] + mod) % mod * calc(n / l, m / l);
		ans %= mod;
	}
	cout << ans;
}