#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define vi vector<int>
#define vll vector<ll>
#define mp make_pair
#define pq priority_queue<int>
#define pi pair<int, int>
#define pll pair<ll, ll>
#define all(x) (x).begin(), (x).end()
#define f(i, n) for (int i = 0; i < n; i++)
#define PI acos(-1)
const int M = 1e9 + 7;
ll binExp(ll a, ll b)
{
int res = 1;
while (b)
{
if (b & 1)
res = res * a;
a *= a;
b /= 2;
}
return res;
}
ll gcd(ll a, ll b)
{
if (a == 0)
return b;
return gcd(b % a, a);
}
ll lcm(ll a, ll b)
{
return (a / gcd(a, b)) * b;
}
ll n, k;
bool fun(ll d)
{
return (k - d * n) >= n;
}
void solve()
{
cin >> n >> k;
ll l = 0, r = k, ans = 0, mid;
while (l <= r)
{
mid = (l + r) / 2;
if (fun(mid))
ans = mid, l = mid + 1;
else
r = mid - 1;
}
ll mx = ans * (k - ans * n);
// cout<<mx<<endl;
k -= (ans * n);
if (k >= n)
mx = max(mx, (ans + 1) * (k - n));
cout << mx << endl;
}
int32_t main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--)
{
solve();
}
return 0;
}