#include <bits/stdc++.h>

int64_t ans = 0;
int n, m;

int64_t dfs1_calls = 0;
int64_t dfs2_calls = 0;

// (ax + b) / (cx + d)
bool dfs2(int a, int b, int c, int d, int x) {
    dfs2_calls++;

    int p = a * 2 * x + b;
    int q = c * 2 * x + d;

    if (q > n || p > m) {
        return false;
    }

    int dlt = 0;
    for (auto [n, m] : std::array{std::pair{::n, ::m}, std::pair{::m, ::n}}) {
        int r1 = a == 0 ? int(1e9) : (n - a * 2 * x - b + 2 * a) / (2 * a);
        int r2 = c == 0 ? int(1e9) : (m - c * 2 * x - d + 2 * c) / (2 * c);
        dlt += std::max(0, std::min(r1, r2));
    }
    ans += dlt;

    for (int k = 1; p + 2 * k * q <= n; k++) {
        if (!dfs2(c, d, a + 2 * k * c, b + d * 2 * k, std::max(k, x))) {
            break;
        }
    }
    return true;
}

void dfs1(int a, int b, int x) {
    dfs1_calls++;

    dfs2(0, b, b, a, x + 1);
    for (int k = 1; b + 2 * int64_t(std::max(x, k) + 1) * (a + 2 * k * b) <= n; k++) {
        dfs1(b, a + 2 * k * b, std::max(x, k));
    }
}

int32_t main() {
    n = m = 3e7;
    n *= 0.9;

    std::cin >> n >> m;

    if (n < m) {
        std::swap(n, m);
    }

    dfs1(0, 1, 0);

    std::cout << ans << std::endl;

    std::cerr << dfs1_calls / 1e6 << "M" << std::endl;
    std::cerr << dfs2_calls / 1e6 << "M" << std::endl;
    return 0;
}