#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
long long c2(long long x){
  x %= MOD;
  return x * (x + MOD - 1) % MOD * 500000004 % MOD;
}
int main(){
  long long n, m;
  cin >> n >> m;
  vector<long long> A;
  for (int i = 0; i < 3; i++){
    A.push_back(n * m - i);
  }
  for (int i = 0; i < 3; i++){
    if (A[i] % 2 == 0){
      A[i] /= 2;
      break;
    }
  }
  for (int i = 0; i < 3; i++){
    if (A[i] % 3 == 0){
      A[i] /= 3;
      break;
    }
  }
  long long ans = 1;
  for (int i = 0; i < 3; i++){
    ans *= A[i] % MOD;
    ans %= MOD;
  }
  int s = max(n, m);
  vector<long long> F(s, 0);
  for (int i = 2; i < s; i++){
    F[i] += (n % i) * (m % i) % MOD * c2((n / i + 1) * (m / i + 1)) % MOD;
    F[i] += (i - n % i) * (m % i) % MOD * c2((n / i) * (m / i + 1)) % MOD;
    F[i] += (n % i) * (i - m % i) % MOD * c2((n / i + 1) * (m / i)) % MOD;
    F[i] += (i - n % i) * (i - m % i) % MOD * c2((n / i) * (m / i)) % MOD;
    F[i] %= MOD;
  }
  vector<bool> prime(s, true);
  for (int i = 2; i < s; i++){
    if (prime[i]){
      for (int j = i * 2; j < s; j += i){
        prime[j] = false;
      }
    }
  }
  vector<int> mobius(s, 1);
  for (int i = 2; i * i < s; i++){
    for (int j = i * i; j < s; j += i * i){
      mobius[j] = 0;
    }
  }
  for (int i = 2; i < s; i++){
    if (prime[i]){
      for (int j = i; j < s; j += i){
        mobius[j] *= -1;
      }
    }
  }
  vector<long long> f(s, 0);
  for (int i = 1; i < s; i++){
    for (int j = i; j < s; j += i){
      f[i] += F[j] * mobius[j / i];
      f[i] += MOD;
      f[i] %= MOD;
    }
  }
  for (int i = 2; i < s; i++){
    ans -= f[i] * (i - 1) % MOD;
    ans += MOD;
    ans %= MOD;
  }
  cout << ans << endl;
}