import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }

struct ModInt(long M) {
  long x;
  this(in ModInt a) { x = a.x; }
  this(in long a) { x = a % M; if (x < 0) x += M; }
  ref ModInt opAssign(in long a) { return this = ModInt(a); }
  ref ModInt opOpAssign(string op)(in ModInt a) {
    static if (op == "+") { x += a.x; if (x >= M) x -= M; }
    else static if (op == "-") { x -= a.x; if (x < 0) x += M; }
    else static if (op == "*") { x *= a.x; x %= M; }
    else static assert(false);
    return this;
  }
  ref ModInt opOpAssign(string op)(in long a) { return mixin("this " ~ op ~ "= ModInt(a)"); }
  ModInt opUnary(string op)() const if (op == "-") { return ModInt(-x); }
  ModInt opBinary(string op, T)(in T a) const { return mixin("ModInt(this) " ~ op ~ "= a"); }
  ModInt opBinaryRight(string op)(in long a) const { return mixin("ModInt(a) " ~ op ~ "= this"); }
  string toString() const { return x.to!string; }
}

enum MO = 10L^^9 + 7;
alias Mint = ModInt!MO;


void main() {
  try {
    for (; ; ) {
      const H = readInt();
      const W = readInt();
      
      const lim = max(H, W);
      
      auto minp = new int[lim + 1];
      auto meb = new int[lim + 1];
      foreach (p; 2 .. lim + 1) {
        if (minp[p] == 0) {
          for (int n = p; n <= lim; n += p) {
            minp[n] = p;
          }
        }
      }
      meb[1] = 1;
      foreach (n; 2 .. lim + 1) {
        if (n / minp[n] % minp[n] == 0) {
          meb[n] = 0;
        } else {
          meb[n] = -meb[n / minp[n]];
        }
      }
      debug {
        writeln("minp = ", minp[0 .. min(31, $)]);
        writeln("meb = ", meb[0 .. min(31, $)]);
      }
      
      auto cntH = new Mint[lim + 1];
      auto cntW = new Mint[lim + 1];
      foreach (d; 1 .. lim + 1) {
        for (int n = d; n <= lim; n += d) {
          cntH[d] += max(H - n, 0);
          cntW[d] += max(W - n, 0);
        }
      }
      debug {
        if (lim <= 10) {
          writeln("cntH = ", cntH);
          writeln("cntW = ", cntW);
        }
      }
      
      Mint ans;
      foreach (d; 1 .. lim + 1) {
        ans += meb[d] * cntH[d] * cntW[d];
      }
      ans *= 2;
      ans += Mint(1) * H * (W - 1);
      ans += Mint(1) * (H - 1) * W;
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}