/*
 * _|_|_|_|_|  _|_|_|_|    _|_|_|  _|_|_|_|_|  _|_|_|      _|_|
 *       _|    _|        _|                _|        _|  _|    _|
 *     _|      _|_|_|      _|_|          _|      _|_|        _|
 *   _|        _|              _|      _|            _|    _|
 * _|_|_|_|_|  _|        _|_|_|      _|        _|_|_|    _|_|_|_|
 */

#include <bits/stdc++.h>

int n, m;
long long ans;

// (ax + b) / (cx + d) -> (cx + d) / (ax + b) + 2x * (cx + d)
void DFS1(int a, int b, int c, int d, int l) {
  ans += std::max(0, (n - d) / c - l + 1);
  ans += std::max(0, std::min(a ? (n - b) / a : m, (m - d) / c) - l + 1);
  for (int x = 1;; x++) {
    int A = a + 2 * x * c, B = b + 2 * x * d;
    if (1LL * A * std::max(l, x) + B > m) break;
    DFS1(c, d, A, B, std::max(l, x));
  }
}

void DFS2(int a, int b, int l) {
  for (int x = 1;; x++) {
    int c = a + 2 * x * b;
    if (2LL * c * std::max(l, x) + b > m) break;
    DFS2(b, c, std::max(l, x));
  }
  DFS1(0, b, 2 * b, a, l + 1);
}

int main() {
#ifdef LOCAL
  freopen("task.in", "r", stdin);
  freopen("task.out", "w", stdout);
  freopen("task.err", "w", stderr);
#endif
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  std::cin >> n >> m;
  if (n > m) std::swap(n, m);
  DFS1(0, 1, 2, 0, 1);
  for (int i = 1; 4 * i * i < m; i++)
    DFS2(1, 2 * i, i);
  std::cout << ans << '\n';

  return 0;
}