#include <iostream>
#include <algorithm>
#include <vector>

using lint = long long;

lint calc(lint n, lint d) {
    if (n <= 0) return 0;
    --d;
    lint block = n / d;
    n -= block * d;
    return d * (d + 1) / 2 * block + n * (n + 1) / 2;
}

void solve() {
    lint d, a, b;
    std::cin >> d >> a >> b;
    std::cout << calc(b, d) - calc(a - 1, d) << "\n";
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    int q;
    std::cin >> q;
    while (q--) solve();

    return 0;
}