import sys

input = sys.stdin.buffer.readline


def g(d, x):
    if x < 0: return 0
    div, mod = divmod(x, d - 1)
    return div * d * (d - 1) // 2 + mod * (mod + 1) // 2


def solve(d, A, B):
    return g(d, B) - g(d, A - 1)


T = int(input())
for _ in range(T):
    print(solve(*map(int, input().split())))