#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using P=pair<ll,ll>;
using V=vector<ll>;
#define rep(i,n) for(ll i=0;i<n;i++)
#define REP(i,n) for(ll i=1;i<=n;i++)

void solve(){
    ll x,a,n=101010,inf=1e18;
    cin >> x >> a;
    V dp(n,inf);
    dp[0]=0;
    rep(j,n) if(j*j+x<dp[j]){
        ll i=0;
        while(i+j<n){
            dp[i+j]=min(dp[i+j],dp[i]+j*j+x);
            i++;
        }
    }
    cout << dp[a] << endl;
}

int main(){
    int t;
    cin >> t;
    rep(i,t) solve();
}