# include <bits/stdc++.h>

using namespace std;

namespace kh {
  constexpr int P(19'940'417);
  inline namespace src {
    template <typename T>
      constexpr auto cmin(T& a, T const& b) {
        if (b < a) return pair<T&, bool>(a = b, true);
        else return pair<T&, bool>(a, false);
      }
    template <typename T>
      constexpr auto cmax(T& a, T const& b) {
        if (a < b) return pair<T&, bool>(a = b, true);
        else return pair<T&, bool>(a, false);
      }
    template <typename T>
      constexpr auto cminmax(T& a, T& b) {
        bool const swp(b < a ? swap(a, b), true : false);
        return make_pair(pair<T&, T&>(a, b), swp);
      }
    template <typename T, class Compare>
      constexpr auto cmin(T& a, T const& b, Compare comp) {
        if (comp(b, a)) return pair<T&, bool>(a = b, true);
        else return pair<T&, bool>(a, false);
      }
    template <typename T, class Compare>
      constexpr auto cmax(T& a, T const& b, Compare comp) {
        if (comp(a, b)) return pair<T&, bool>(a = b, true);
        else return pair<T&, bool>(a, false);
      }
    template <typename T, class Compare>
      constexpr auto cminmax(T& a, T& b, Compare comp) {
        bool const swp(comp(b, a) ? swap(a, b), true : false);
        return make_pair(pair<T&, T&>(a, b), swp);
      }
    template <typename T>
      constexpr int sgn(T const x)
      { return (x > 0) - (x < 0); }
    template <typename T>
      struct frac {
        T num, den;
        constexpr frac(T const n = 0, T const d = 1)
          : num(n / __gcd(n, d)), den(d / __gcd(n, d))
        { assert(den), num *= sgn(den), den *= sgn(den); }
        constexpr frac& operator+=(frac const b) { return *this = *this + b; }
        constexpr frac& operator-=(frac const b) { return *this = *this - b; }
        constexpr frac& operator*=(frac const b) { return *this = *this * b; }
        constexpr frac& operator/=(frac const b) { return *this = *this / b; }
        constexpr frac& operator++() { return num += den, *this; }
        constexpr frac& operator--() { return num -= den, *this; }
        constexpr frac operator++(int) { return num += den, *this - 1; }
        constexpr frac operator--(int) { return num -= den, *this - 1; }
        constexpr frac operator+() const { return frac(+num, den); }
        constexpr frac operator-() const { return frac(-num, den); }
        friend constexpr frac operator+(frac const a, frac const b)
        { return frac(a.num * b.den + b.num * a.den, a.den * b.den); }
        friend constexpr frac operator-(frac const a, frac const b)
        { return frac(a.num * b.den - b.num * a.den, a.den * b.den); }
        friend constexpr frac operator*(frac const a, frac const b)
        { return frac(a.num * b.num, a.den * b.den); }
        friend constexpr frac operator/(frac const a, frac const b)
        { return frac(a.num * b.den, a.den * b.num); }
        friend constexpr bool operator==(frac const a, frac const b)
        { return a.num * b.den == b.num * a.den; }
        friend constexpr bool operator!=(frac const a, frac const b)
        { return a.num * b.den != b.num * a.den; }
        friend constexpr bool operator<(frac const a, frac const b)
        { return a.num * b.den < b.num * a.den; }
        friend constexpr bool operator>(frac const a, frac const b)
        { return a.num * b.den > b.num * a.den; }
        friend constexpr bool operator<=(frac const a, frac const b)
        { return a.num * b.den <= b.num * a.den; }
        friend constexpr bool operator>=(frac const a, frac const b)
        { return a.num * b.den >= b.num * a.den; }
      };
    constexpr int pow(int a, int n) {
      int r(1);
      while (n) {
        r = 1l * r * (n & 1 ? a : 1) % P;
        a = 1l * a * a % P, n >>= 1;
      }
      return r;
    }
  }
  int iv6, n, m, sn, sm, ans;
  void main() {
    for (int i(1); i != P; ++i)
      if (6 * i % P == 1) { iv6 = i; break; }
    cin >> n >> m, cminmax(n, m);
    for (int i(1); i * i <= n; ++i)
      sn = (sn + n % i) % P;
    for (int i(1); i * i < n; ++i) {
      int const l(n / (i + 1)), r(n / i);
      sn = (sn + 1l * n * (r - l)) % P;
      sn = (sn - 1l * (l + r + 1) * (r - l) / 2 % P * i) % P;
    }
    for (int i(1); i * i <= m; ++i)
      sm = (sm + m % i) % P;
    for (int i(1); i * i < m; ++i) {
      int const l(m / (i + 1)), r(m / i);
      sm = (sm + 1l * m * (r - l)) % P;
      sm = (sm - 1l * (l + r + 1) * (r - l) / 2 % P * i) % P;
    }
    ans = 1l * sn * sm % P;
    for (int l(1), r; l <= n; l = r + 1) {
      r = min(n / (n / l), m / (m / l)), --l;
      int const s0((r - l) % P);
      int const s1(1l * (l + r + 1) * (r - l) / 2 % P);
      int s2(0);
      s2 += 1l * r * (r + 1) % P * (2 * r + 1) % P * iv6 % P;
      s2 -= 1l * l * (l + 1) % P * (2 * l + 1) % P * iv6 % P;
      ans = (ans - 1l * n * m % P * s0) % P;
      ans = (ans + 1l * n / r * m % P * s1) % P;
      ans = (ans + 1l * m / r * n % P * s1) % P;
      ans = (ans - 1l * (n / r) * (m / r) % P * s2) % P;
    }
    cout << (ans = (ans + P) % P) << endl;
  }
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int t(1);
  // cin >> t;
  for (int i(1); i <= t; ++i) kh::main();
}