#include<bits/stdc++.h>
#define For(i,x,y) for (register int i=(x);i<=(y);i++)
#define FOR(i,x,y) for (register int i=(x);i<(y);i++)
#define Dow(i,x,y) for (register int i=(x);i>=(y);i--)
#define Debug(v) for (auto i:v) cout<<i<<" ";puts("")
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define ep emplace_back
#define siz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define fil(a,b) memset((a),(b),sizeof(a))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pa;
typedef pair<ll,ll> PA;
typedef vector<int> poly;
inline ll read(){
    ll x=0,f=1;char c=getchar();
    while ((c<'0'||c>'9')&&(c!='-')) c=getchar();
    if (c=='-') f=-1,c=getchar();
    while (c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
    return x*f;
}

inline void solve(){
    int n=read(),m=read();
    if (n<m) swap(n,m);
    int ansl=1<<30,ansr=0;
    for (int l=2,r;l<=n;l=++r){
        if (l>m) r=n/(n/l);
            else r=min(n/(n/l),m/(m/l));
        int k1=n/l,k2=m/l;
        if (k1==k2){
            if (n==m) ansl=min(ansl,l),ansr=max(ansr,r);
            continue;
        }
        if ((n-m)%(k1-k2)==0){
            int t=(n-m)/(k1-k2);
            if (t>=l&&t<=r&&t-1>=1) ansl=min(ansl,t),ansr=max(ansr,t);
        }
    }
    if (!ansr) return puts("-1 -1"),void(0);
    printf("%d %d\n",ansl,ansr);
}

int main(){
    int T=read();
    while (T--) solve();
}