import math

def compute_sum_floor(m, k):
    if m == 0:
        return 0
    res = 0
    v_max = int(math.isqrt(m))
    # Handle v from 1 to v_max
    for v in range(1, v_max + 1):
        s_start = m // (v + 1) + 1
        s_end = m // v
        s_end = min(s_end, k)
        if s_start > s_end:
            continue
        res += v * (s_end - s_start + 1)
    # Handle s from 1 to min(v_max, k)
    s_max = min(v_max, k)
    for s in range(1, s_max + 1):
        v = m // s
        if v > v_max:
            res += v
    return res

H, W = map(int, input().split())

if H == 0 or W == 0:
    print(0)
else:
    d = abs(W)
    cnt = max(0, H - d + 1)
    k = min(H, d - 1)
    m = d - 1
    sum_floor = compute_sum_floor(m, k)
    sum_ceil = k + sum_floor
    total = cnt + sum_ceil
    print(total)