SPOJ 4491

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define N 10000005

using namespace std;
typedef long long LL;

bool check[N];
int mu[N],tot;
int prime[N],he[N];

void initial(){
	memset(check,false,sizeof(check));
	memset(he,0,sizeof(he));
	mu[1]=1;
	tot=0;
	for(LL i=2;i<N;i++){
		if(!check[i]){
			prime[tot++]=i;
			he[i]=1;
			mu[i]=-1;
		}
		for(LL j=0;j<tot;j++){
			if(i*prime[j]>N) break;
			check[i*prime[j]]=true;
			if(i%prime[j]==0){
				mu[i*prime[j]]=0;
				he[i * prime[j]] = mu[i];
				break;
			}
			else{
				he[i*prime[j]] = mu[i] - he[i];  

				mu[i*prime[j]]=-mu[i];
			}
		}
	}
	for(int i=2;i<N;i++)
	he[i]+=he[i-1];
}


LL slove(int tx,int ty){
	if(tx>ty) swap(tx,ty);
	int l=1,r,p1,p2;
	LL ans=0;
	while(l<=tx){
		r=min(min(tx/(p1=tx/l),ty/(p2=ty/l)),tx);
		ans+=((LL) p1*(LL )p2*(LL )(he[r]-he[l-1]));
		l=r+1;
	}
	return ans;
}

int main(){
	initial();
	int T;
	scanf("%d",&T);
	int x,y,tx,ty;
	LL ans;
	while(T--){
		scanf("%d%d",&x,&y);
		ans=slove(x,y);
		printf("%lld\n",ans);
	}
	return 0;
}