#include <stdio.h>
#include <vector>
using namespace std;
typedef long long int ll;

#define PB push_back
constexpr int kMod = int(1E9 + 7), kN = int(3E6 + 10);

int ABS(int n) {return n >= 0 ? n : -n;}
int gcd(int a, int b) {return  b ? gcd(b, a % b) : a;}

ll Pow(ll a, ll b) {
	ll ans = 1;
	while (b) {
		if (b & 1) ans = ans * a % kMod;
		a = a * a % kMod;
		b >>= 1;
	}
	return ans;
}
ll Rev(ll n) {return Pow(n, kMod - 2);}

ll mu[kN];

void pre() {
	mu[0] = 0;
	mu[1] = 1;
	vector<int> prime;
	for (int i = 2; i < kN; i++) mu[i] = -3;
	for (int i = 2; i < kN; i++) {
		if (mu[i] == -3) {
			mu[i] = -1;
			prime.PB(i);
		}
		for (int j : prime) {
			if (i * j >= kN) break;
			if (i % j == 0) {
				mu[i * j] = 0;
				break;
			}
			else mu[i * j] = -mu[i];
		}
	}
	return ;
}

int main() {
	pre();
	int n, m;
	ll ans = 0, l, r;
	scanf("%d%d", &n, &m);
	for (int d = 1; d < n; d++) {
		l = -(((n - 1) / d) * ((n - 1) / d + 1)) / 2;
		r = -(((m - 1) / d) * ((m - 1) / d + 1)) / 2;
		l *= d;
		r *= d;
		l += n * ((n - 1) / d);
		r += m * ((m - 1) / d);
		l %= kMod;
		r %= kMod;
		ans += l * r * mu[d] % kMod;
	}
	ans = ans * 2 % kMod;
	if (ans < 0) ans += kMod;
	ans += (n - 1) * m % kMod + (m - 1) * n % kMod;
	ans %= kMod;
	printf("%lld\n", ans);
}