#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
using mint = modint998244353;

void solve() {
  ll X, A; cin >> X >> A;
  ll ans = 1e18;
  for (ll i = 1; i <= A; i++) {
    ll res = X * i;
    ll b = A / i;
    ll m = A % i;
    res += b * b * (i - m);
    res += (b + 1) * (b + 1) * m;
    ans = min(ans, res);
  }
  cout << ans << endl;
}

int main() {
  int T; cin >> T;
  while (T--) solve();
  return 0;
}