def f(n, d):
    q = n // d
    r = n % d
    return q * d * (d + 1) // 2 + r * (r + 1) // 2

def solve():
    d, a, b = map(int, input().split())
    if a == 0:
        a = 1
    print(f(b, d - 1) - f(a - 1, d - 1))

t = int(input())
for i in range(t):
    solve()