#include<bits/stdc++.h>

#define pb push_back
#define mp make_pair
#define fi first
#define se second

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

template <typename T> bool chkmax(T &x,T y){return x<y?x=y,true:false;}
template <typename T> bool chkmin(T &x,T y){return x>y?x=y,true:false;}

int readint(){
    int x=0,f=1; char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}

const int cys=998244353;
int a,b,n,m,k;
int p[200005],p1[200005],p2[200005];

ll qpow(ll x,ll p){
    ll ret=1;
    for(;p;p>>=1,x=x*x%cys) if(p&1) ret=ret*x%cys;
    return ret;
}

int main(){
    int T=readint();
    while(T--){
        a=readint(); b=readint();
        if(a<=1&&b<=1){
            printf("-1 -1\n");
            continue;
        }
        if(a==b){
            printf("2 %d\n",a);
            continue;
        }
        if(a<b) swap(a,b);
        n=m=k=0;
        for(int i=1,j;i<=a;i=j+1){
            j=a/(a/i);
            p1[++n]=j;
        }
        for(int i=1,j;i<=b;i=j+1){
            j=b/(b/i);
            p2[++m]=j;
        }
        int t1=1,t2=1;
        while(t1<=n&&t2<=m){
            if(p1[t1]<=p2[t2]) p[++k]=p1[t1++];
            else p[++k]=p2[t2++];
        }
        while(t1<=n) p[++k]=p1[t1++];
        while(t2<=m) p[++k]=p2[t2++];
        k=unique(p+1,p+k+1)-p-1;
        int mina=1<<30,maxa=-1;
        for(int i=1;i<=k;i++){
            int ta=a/p[i],tb=b/p[i];
            if(ta==tb) continue;
            if((a-b)%(ta-tb)==0){
                int tmp=(a-b)/(ta-tb);
                if(tmp<=p[i-1]||tmp>p[i]) continue;
                if(tmp==1) continue;
                chkmin(mina,tmp);
                chkmax(maxa,tmp);
            }
        }
        if(maxa<0) printf("-1 -1\n");
        else printf("%d %d\n",mina,maxa);
    }
    return 0;
}