#include <bits/stdc++.h>

using namespace std;
using i64 = long long;

void solve() {
    int n, k; cin >> n >> k;
    auto f = [&] (int m) {
        return (k - m * n) * m;
    };
    int l = 0, r = k / n + 1;
    while (r - l > 1) {
        int m = l + (r - l) / 2;
        if (f(m) < f(m + 1)) l = m;
        else r = m;
    }
    cout << (k - r * n) * r << '\n';
}

signed main()
{
    ios::sync_with_stdio(false); cin.tie(nullptr);
    i64 T; cin >> T;
    while(T--) solve();
    return 0;
}