#include <bits/stdc++.h>
#define taskname ""
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define i64 long long
#define pb push_back
#define ff first
#define ss second
#define isz(x) (int)x.size()
using namespace std;

const int mxN = 2e5 + 5;
const int mod = 1e9 + 7;
const i64 oo = 1e18;

i64 n, r;
long double sqrtr;

tuple<i64, i64, i64> inverse(i64 &a, i64 &b, i64 &c) {
	return {-a * c, b * c, b * b - a * a * r};
}

i64 calc(i64 a, i64 b, i64 c, i64 n) {
	i64 g = __gcd(a, __gcd(b, c));
	a /= g, b /= g, c /= g;

	if (n == 0) return 0;
	long double y = (a * sqrtr + b) / c; i64 floory = y;
	
	if (floory >= 1) return n * (n + 1) / 2 * floory + calc(a, b - floory * c, c, n);
	
	i64 nn = y * n;
	tie(a, b, c) = inverse(a, b, c);
	return n * nn - calc(a, b, c, nn);
}

void solve() {
	cin >> n >> r; sqrtr = sqrtl(r);
	if ((i64)sqrtr * (i64)sqrtr == r) cout << ((i64)sqrtr & 1 ? (n & 1 ? -1 : 0) : n) << "\n";
	else cout << n + 4 * calc(1, 0, 2, n) - 2 * calc(1, 0, 1, n) << "\n";
}

signed main() {

#ifndef CDuongg
    if(fopen(taskname".inp", "r"))
        assert(freopen(taskname".inp", "r", stdin)), assert(freopen(taskname".out", "w", stdout));
#else
    freopen("bai3.inp", "r", stdin);
    freopen("bai3.out", "w", stdout);
    auto start = chrono::high_resolution_clock::now();
#endif

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1; cin >> t;
    while(t--) solve();

#ifdef CDuongg
   auto end = chrono::high_resolution_clock::now();
   cout << "\n"; for(int i = 1; i <= 100; ++i) cout << '=';
   cout << "\nExecution time: " << chrono::duration_cast<chrono::milliseconds> (end - start).count() << "[ms]" << endl;
   cout << "Check array size pls sir" << endl;
#endif

}