#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define FOR(i, l, r) for(ll i = l; i < r; i++)
#define rep(i, n) FOR(i, 0, n)
#define FORR(i, l, r) for(ll i = r - 1; i >= l; i--)
#define ALL(ar) begin(ar), end(ar)

template <typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {
    return a < b && (a = b, true);
}
template <typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {
    return a > b && (a = b, true);
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
    is >> p.first >> p.second;
    return is;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
    os << p.first << ' ' << p.second;
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
    for(T &x : v) is >> x;
    return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    for(size_t i = 0; i < v.size(); i++) os << (i ? " " : "") << v[i];
    return os;
}
//-------------------------------------------------

const vector<ll> a{2,  3,  6,  7,  8,  11, 12,  15,  18, 19, 22,
                   23, 24, 27, 28, 31, 32, 33,  43,  44, 47, 48,
                   60, 67, 72, 76, 92, 96, 108, 112, 128};

bool isok(ll mid, ll R, ll B) {
    ll sum = mid * (mid + 1) / 2 * (2 * mid + 1) / 3;
    if(sum > R + B) return false;
    if(sum <= R || sum <= B) return true;
    if(mid < 20) {
        bitset<3000> b;
        b.set(0);
        rep(i, mid + 1) b |= b << (i * i);
        while(R >= sum - B) {
            if(b[R] && b[sum - R]) return true;
            R--;
        }
        return false;
    }
    while(R >= sum - B) {
        if(!binary_search(ALL(a), R) && !binary_search(ALL(a), sum - R))
            return true;
        R--;
    }
    return false;
}

void solve() {
    ll R, B;
    cin >> R >> B;
    ll ok = 1, ng = 1817122;
    while(ng - ok > 1) {
        ll mid = (ng + ok) / 2;
        (isok(mid, R, B) ? ok : ng) = mid;
    }
    cout << ok << endl;
}

int main() {
    int t = 1;
    // cin >> t;
    while(t--) solve();
}