#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;

#include <bits/stdc++.h>
using namespace std;


int main() {
  int t;
  cin>>t;
  
  while(t--){
    ll d,a,b;
    cin>>d>>a>>b;
    
    ll ans=0;
    ll x=(b-a)/(d-1);
    ans+=(d-1)*d/2*x;
    ll p,q;
    if((a+x*(d-1))%(d-1)==0) p=d-1;
    else p=(a+x*(d-1))%(d-1);
    if(b%(d-1)==0) q=d-1;
    else q=b%(d-1);
    
    if(b!=0 && p==q) ans+=p;
    else if(p<q) ans+=(q-p+1)*(p+q)/2;
    else if(p>q) ans+=(d-p)*(p+d-1)/2+q*(q+1)/2;
    
    if(a==0 && ans>0) ans-=d-1;
    
    cout<<ans<<endl;
  }
  
  return 0;
}