#include<bits/stdc++.h>
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,tune=native")
using namespace std;
// #define int long long
#define i64 __int128
#define ll long long
#define ld long double
#define vec vector
#define pii pair<ll,ll>
#define mpr make_pair
#define pb push_back
#define fir first
#define sec second
const ll N = 1010;
const ll M = 30010;
const ll V = 1.05e7;
const ll INF = (ll)1e18;
const ll mod = 1e9+7;
inline ll kpow(ll x,ll y,ll MOD){ll BASE=x%MOD,ret=1;while(y){if(y&1) ret=ret*BASE%MOD;BASE=BASE*BASE%MOD;y>>=1;}return ret;}
inline ll read(){ll ret=0,f=1;char ch=getchar();while(!isdigit(ch)){if(ch=='-') f*=-1;ch=getchar();}while(isdigit(ch)){ret=(ret<<3)+(ret<<1)+ch-'0';ch=getchar();}return ret*f;}
inline ll gcd(ll x,ll y){return y==0?x:gcd(y,x%y);}
inline void write(ll x){if(x>=10) write(x/10);putchar('0'+x%10);}
inline void wr(ll x){if(x<0)putchar('-');write(abs(x));}
inline ll lb(ll x){return x&(-x);}
inline ll pc(ll x){ll ret=0;while(x>0)ret++,x-=lb(x);return ret;}
ll f[N][N];
void pre_work(){
    for(int i=2;i<=2;i++)
        for(int j=1;j<=1000;++j) f[i][j]=(i+j)*(i+j-1)/2;
    for(ll i=3;i<=1000;++i)
        for(ll j=1;j<=1000;++j){
            if(i>j+1) f[i][j]=j+1;
            else {
                f[i][j]=1e18;
                for(int k=1;k<=j+1;++k){
                    f[i][j]=min(f[i][j],f[i-1][j-(k-1)]+k*(k-1)/2);
                }
            }
        }
}
void multi_test(){
    int x,y;
    cin>>x>>y;
    cout<<f[x][y]<<endl;
    return ;
}
int main(){
    // freopen("data.in","r",stdin);
    // freopen("my.out","w",stdout);
    // ios::sync_with_stdio(0);cin.tie(0);
    srand(time(NULL));
    pre_work();
    int T; cin>>T;
    // int T=1;
    while(T--)  multi_test();
    return 0;
}