#include <iostream>
#include<numeric>
#include<algorithm>
#include<deque>
using namespace std;
#define ll long long int
#define ld long double
#define endl '\n'
#define MIR183_Mac ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
void solve() {
// Your code here
ll a,b;
cin>>a>>b;
// ll x=gcd(a,b);
// ll y=lcm(a,b);
// cout<<x<<" "<<y<<endl;
// deque<deque<ll>>v(a+1,deque<ll>(b+1,0));
ll ans=0;
for(ll i=1;i<=a;i++){
for(ll j=1;j<=b;j++){
// ll gcdij=gcd(i,j);
// ll gcdij=v[i][j];
// ll lcmij=(i*j)/gcdij;
if(i!=j) ans++;
}
}
// for(ll i=1;i<=a;i++){
// for(ll j=1;j<=b;j++){
// ll gcdij=v[i][j];
// ll lcmij=(i*j)/gcdij;
// if(gcdij!=lcmij) ans++;
// }
// }
cout<<ans<<endl;
// ans=0;
}
signed main() {
MIR183_Mac;
// Always use ll, int may give TLE
ll tt;
// tt=1;
cin >> tt;
while (tt--) {
solve();
}
return 0;
}