#include <bits/stdc++.h>

using namespace std;
using ll = long long;

constexpr int N = 1e6 + 1;
int t = 0;
pair<int, int> q[N];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    auto st = clock();

    int n, m;
    cin >> n >> m;

    q[t++] = {1, 2};
    q[t++] = {2, 1};
    ll s = 0;
    auto process = [&](auto process, int a, int b, int lvl) {
        if (lvl > 3) {
            q[t++] = {a, b};
            return;
        }
        s += 1;
        if (a + b * 2 <= n) {
            s += (n - a) / (b * 2);
            if (b + 2 * (a + 2 * b) <= m) {
                for (int k = 2; b + 2 * (a + k * b) <= m; k += 2) {
                    process(process, a + b * k, b + 2 * (a + k * b), lvl + 1);
                }
            }
        }
        if (b + a * 2 <= m) {
            s += (m - b) / (2 * a);
            if (a + 2 * (b + 2 * a) <= n) {
                for (int k = 2; a + 2 * (b + k * a) <= n; k += 2) {
                    process(process, a + 2 * (b + k * a), b + a * k, lvl + 1);
                }
            }
        }
    };
    while (t) {
        auto [a, b] = q[--t];
        process(process, a, b, 0);
    }

    cout << s << '\n';
//    cerr << (clock() - st) / double(CLOCKS_PER_SEC) << endl;

    return 0;
}