#include <iostream> #include <vector> using namespace std; typedef long long ll; int used[3000010]; ll ans = 0,mod = 1000000007,h,w; void solve(int x){ int y = x; vector<int> fac; while(y!=1){ int k = used[y]; fac.push_back(k); while(y%k==0 && y!=1){ y /= k; } } int i,j,s = fac.size(); ll num = 0,sum = 0; for(i=0;i<(1<<s);i++){ ll z = 1,sig = 1; for(j=0;j<s;j++){ if((1<<j) & i){ z *= fac[j]; sig *= -1; } } ll y = w/z; num += sig*y; (sum += sig*(z*y*(y + 1)/2%mod) + mod) %= mod; } //cout << x << endl; //cout << num << " " << sum << endl; (ans += (h - x)*(w*num - sum + mod)%mod) %= mod; } int main(){ int i,j; cin >> h >> w; for(i=1;i<=3000000;i++){ used[i] = -1; } used[1] = 1; for(i=2;i<=h;i++){ for(j=i;j<=h;j+=i){ if(used[j]==-1) used[j] = i; } } for(i=1;i<=h;i++){ solve(i); } ans *= 2; (ans += h*(w - 1)%mod + w*(h - 1)%mod) %= mod; cout << ans << endl; }