#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <atcoder/modint>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

using mint = atcoder::modint1000000007;

ostream& operator<<(ostream& os, const mint& m){
    os << m.val();
    return os;
}

mint comb3(mint n){
    mint ans = n*(n-1)*(n-2)/6;
    return ans;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n, m; cin >> n >> m;
    if(n > m) swap(n, m);
    vector<mint> sum(n+1);
    for(int g = 1; g <= n; g++){
        int xl = g, xr = (n/g)*g;
        int yl = g, yr = (m/g)*g;
        mint sum_x = (mint(n-xl)+mint(n-xr))*(n/g)/2;
        mint sum_y = (mint(m-yl)+mint(m-yr))*(m/g)/2;
        sum[g] = sum_x*sum_y;
    }
    mint ans = comb3(mint(n)*mint(m));
    for(int g = n; g >= 1; g--){
        for(int i = 2; i*g <= n; i++){
            sum[g] -= sum[g*i];
        }
        ans -= sum[g]*(g-1)*2;
    }
    ans -= comb3(mint(n))*m;
    ans -= comb3(mint(m))*n;
    cout << ans << endl;
}