#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
using P = pair<int,int>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()

int main(){
    ll a,b;
    cin >> a >> b;
    ll ans;
    if(a<=b){
        a %= MOD;
        ans = (2 * (a + 1) * a + 1) % MOD;
    }else{
        if(!b) ans = (a + !(a % 2)) % MOD;
        else{
            a %= MOD; b %= MOD;
            ans = (b + 1) * a + b * (a + 1) + 1;
            ans %= MOD;
        }
    }
    cout << ans << endl;
    return 0;
}