#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
using ll=long long;
typedef pair<int, int> P;
ll solve(ll d, ll a){
    if(a<=0) return 0;
    ll q=a/(d-1);
    ll r=a%(d-1);
    return q*d*(d-1)/2+r*(r+1)/2;
}
ll solve(ll d, ll a, ll b){
    return solve(d, b)-solve(d, a-1);
}
int main()
{
    int t; cin>>t;
    while(t--){
        ll d, a, b; cin>>d>>a>>b;
        cout<<solve(d, a, b)<<endl;
    }
    return 0;
}