#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#define tof_io ios_base::sync_with_stdio(false);cin.tie(0) , cout.tie(0);
#define double long double
#define int long long
#define pb push_back
#define all(x) x.begin(),x.end()
#define endl '\n'
#define sz(x) x.size()
const int mod = 1e9 + 7; //998244353 1e9+7 1e9+9
const int N = 2e4 + 1;
const int lg = 23;
const int eps = 1e-9;
const int inf = 1e9;
int fac[N];
int inv[N];
int n;
double ans = 0;
int dnt_pow (int a, int b, int md = mod){int ans = 1; while(b){if(b&1){ans = (a*ans)%md;}a = (a*a)%md;b >>= 1;}return ans ;}
void dnt_bld (){fac[0] = 1; inv[0] = dnt_pow(fac[0],mod-2) ;for(int i = 1 ; i < N ; i++) {fac[i] = (fac[i-1] * i) % mod;inv[i] = dnt_pow( fac[i] , mod-2);}}
int dnt_ncr (int r,int n){if(r>n) return 0; return fac[n] * inv[r] % mod * inv[n-r] % mod;}
int arr[N], dsu[N], pos[N];
vector<int> edg[N];
int fnd(int u){return (u==dsu[u]) ? u:fnd(dsu[u]);}
int32_t main()
{
int t;
cin >> t;
while(t--)
{
int g ;
cin >> g;
int h;
cin >> h;
int ans1 = h;
while(ans1 <= g) ans1 = ans1 * h;
ans1 = ans1 + g - 1;
ans1 = (ans1 / g) * g;
int ans = h * ans1 + g;
if(ans1 > ans) swap(ans1,ans);
cout << ans << ' ' << ans1 << endl;
}
}
