Untitled

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long int
#define ff first
#define ss second
#define pii pair<int, int>
#define ld long double
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define forn(i,a,b) for(int i=a;i<b;i++)
using namespace std;
using namespace __gnu_pbds;
int mod = (int)998244353;
int mod2 = (int)1e9 + 7;
int gcd(int a, int b) {if (b == 0) return a; return gcd(b, a % b);}
bool sortbysec(const pair<int,int> &a,const pair<int,int> &b){return (a.second < b.second);}
int pwr(int a, int b) {a %= mod; int res = 1; while (b > 0) {if (b & 1) res = res * a % mod; a = a * a % mod; b >>= 1;} return res;} 
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds; // find_by_order, order_of_key
void solve(){
    int n,a,b;
    cin>>n>>a>>b;
    int res=0;
    for(int i=0;i<n;i++){
        res+=max(a,b-i);
    }
    cout<<res<<endl;
}
int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    int T;
    cin>>T;
    while(T--){
        solve();
    }
    return 0;
}