rt，$T$了最后一个$subtask$/kk

算法感觉没啥问题……线性筛预处理莫比乌斯函数前缀和是$O(n)$的……后面枚举$k$的部分整除分块应该是$O(\sqrt n)$的，总时间复杂度应该是$O(n+T\sqrt n)$……算了算应该能过？火车头都上了还是$T$……

果然人傻常数大是真的，是不是我自带$114514$的大常数啊/kk 或者是我什么地方写假了有神仙帮忙看看吗/kel

#pragma GCC diagnostic error "-std=c++11"
#pragma GCC target("avx")
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define ll long long
#define maxn 10000000
using namespace std;

ll n, m, t, tot;
ll mu[maxn], isprime[maxn], prime[maxn], f[maxn], sum[maxn];

inline ll read()
{
	char v = getchar();ll x = 0, f = 1;
	while (!isdigit(v)) { if (v == '-')f = -1;v = getchar(); }
	while (isdigit(v)) { x = x * 10 + v - 48;v = getchar(); }
	return x * f;
}

inline void write(ll x)
{
    if (x < 0) putchar('-'), x = -x;
    if (x > 9) write(x / 10);
    putchar(x % 10 + '0');
}

void sieve()
{
	mu[1] = 1;
	for (ll i = 2;i <= maxn;i++)
	{
		if (!isprime[i]) prime[++tot] = i, mu[i] = -1;
		for (ll j = 1;j <= tot && i * prime[j] <= maxn;j++)
		{
			isprime[i * prime[j]] = 1;
			if (i % prime[j] == 0) break;
			mu[i * prime[j]] = -mu[i];
		}
	}
	for (ll i = 1;i <= tot;i++)
		for (ll j = 1;prime[i] * j <= maxn;j++)
			f[j * prime[i]] += mu[j];
	for (ll i = 1;i < maxn;i++)
		sum[i] = sum[i - 1] + f[i];
}

ll get_ans(ll n, ll m)
{
	ll ans = 0;
	if (n > m) swap(n, m);
	for (ll l = 1, r = 0;l <= n;l = r + 1)
	{
		r = min(n / (n / l), m / (m / l));
		ans += (sum[r] - sum[l - 1]) * (n / l) * (m / l);
	}
	return ans;
}

int main(void)
{
	sieve();
	t = read();
	while (t--)
	{
		n = read(), m = read();
		write(get_ans(n, m));puts("");
	}
	return 0;
}