def F(x):
    res = int(x ** 0.5)
    for i in range(-2, 3)[::-1]:
        if (res + i) * (res + i) <= x:
            return res + i


def naive(a, N):
    res = 0
    for i in range(1, N+1):
        print(i, F(a * i))
        res += F(a * i)
    return res


def ub(a, target):
    l = 0
    r = 10 ** 18
    while r - l > 1:
        m = (r + l) // 2
        if a * m < target * target:
            l = m
        else:
            r = m
    return r


def lb(a, target):
    l = 0
    r = 10 ** 18
    while r - l > 1:
        m = (r + l) // 2
        if a * m < target * target:
            l = m
        else:
            r = m
    return r


T = int(input())
for _ in range(T):
    a, N = map(int, input().split())
    sq = int(N ** 0.5 + 1)

    lim = F(a * sq)

    ans = 0
    for i in range(1, N + 1):
        tmp = F(a * i)
        if tmp >= lim:
            key = i
            break
        ans += tmp

    L = lim
    R = F(a * N)
    p = lb(a, L)
    for k in range(L, R+1):
        q = ub(a, k + 1)
        q = min(N + 1, q)
        ans += k * (q - p)
        p = q
    # print(ans, naive(a, N))
    print(ans)