X = 85344
sqrtX = 292

def solve(v):
    ng = 1817123
    ans = 0
    while ng - ans > 1:
        mid = (ans + ng) // 2
        if mid * (mid + 1) * (2 * mid + 1) // 6 <= v:
            ans = mid
        else:
            ng = mid
    return ans


B, W = map(int, input().split())
if B > W:
    B, W = W, B
ans = 0
if B > X:
    ans = solve(B + W)
else:
    dp0 = [False] * (B + 1)
    dp1 = [False] * (B + 1)
    dp0[B] = True
    Q = B
    S = 0
    for i in range(1, sqrtX + 1):
        dp1 = [False] * (B + 1)
        t = i * i
        S += t
        for j in range(B + 1):
            if dp0[j]:
                Q = min(Q, j)
                if j >= t:
                    dp1[j - t] = True
                if S - (B - j) <= W:
                    dp1[j] = True
        dp0 = dp1[:]
    ans = solve(B + W - Q)
print(ans)