#include<bits/stdc++.h>

using namespace std;
#define ll long long
#define int ll
# define double long double
const int N = 2e5 + 2, MOD = 1e9 + 7;
#define deb(x) cout<<#x<<"="<<x<<endl;
#define F first
#define S second
int n, k;

int ternary_search(int l, int r) {
    while (l <= r) {

        int m1 = l + (r - l) / 3;
        int m2 = r - (r - l) / 3;
        int f1 = (k - (m1*n)) * m1;      //evaluates the function at m1
        int f2 = (k - (m2*n)) * m2;      //evaluates the function at m2
        if (f1 < f2)
            l = m1 + 1;
        else
            r = m2 - 1;
    }
    return (k - (l*n)) * l;
}


void solve() {
    cin >> n >> k;
    if (n >= k) {
        cout << 0;
        return;
    }
    cout << ternary_search(0, k);


}

signed main() {
    ios_base::sync_with_stdio(false);
    cout.tie(NULL);
    cin.tie(NULL);
//#ifndef ONLINE_JUDGE
//    freopen("output.txt", "w", stdout);
//    freopen("input.txt", "r", stdin);
//#endif
    int tt = 1;
    cin >> tt;
    for (int i = 0; i < tt; i++) {
//        cout << "Case " << i + 1 << ": ";
        solve();
        cout << "\n";
    }
}