#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
#include<map>
using namespace std;
typedef long long LL;
LL cx[10],cy[10];
void turn(string s,LL c[]){
	for(int i=0;i<3;i++){
		c[2-i]=s[i]-'0';
	}
}
LL calc(LL base,LL c[]){
	LL ans=0;
	LL ind=1;
	for(int i=0;i<3;i++){
		ans+=c[i]*ind;
		ind*=base;
	}
	return ans;
}
string X,Y;
map<LL,int> lis;
void work(void){
	lis.clear();
	cin>>X>>Y;
	turn(X,cx);
	turn(Y,cy);
	for(int b=10;b<=15000;b++){
		lis[calc(b,cx)]=b;
	}
	for(int b=10;b<=15000;b++){
		int now=calc(b,cy);
		if(lis.count(now)){
			printf("%d %d\n",lis[now],b);
			return;
		}
	}
}
int main(){
	freopen("whatbase.in","r",stdin);
	freopen("whatbase.out","w",stdout);
	int T;
	scanf("%d",&T);
	while(T--){
		work();
	}
	return 0;
}