#include<bits/stdc++.h>
using namespace std;

const int nmax=1e6+42;

int n;
int wanted[nmax];

pair<long long/*count*/,long long/*value*/> inp[nmax];

pair<long long,long long> mem[nmax];

void sub(long long &p,long long &q)
{
    long long g=__gcd(p,q);
    p=p/g;
    q=q/g;
}
void solve()
{
    scanf("%i",&n);
    for(int i=1;i<=n;i++)scanf("%i",&wanted[i]);

    for(int i=1;i<=n;i++)scanf("%lld%lld",&inp[i].first,&inp[i].second);

    if(n==1)
    {
        printf("%lld %lld\n",1LL*inp[1].second,1LL*inp[1].first*inp[1].second);
        return;
    }

    long long dvd=0;

    for(int i=1;i<=n;i++)
    {
        long long u=1LL*wanted[1]*inp[i].second;
        long long v=1LL*wanted[i]*inp[1].second;

        long long g=__gcd(u,v);

        u=u/g;
        v=v/g;

        //cout<<i<<" -> "<<u<<" "<<v<<endl;

        if(u>inp[1].first||v>inp[i].first)
        {
            printf("-1\n");
            return;
        }

        mem[i]={u,v};

        if(dvd)dvd=dvd*u/__gcd(dvd,u);
        else dvd=u;

        if(dvd>inp[1].first)
        {
            printf("-1\n");
            return;
        }
    }

    //cout<<"dvd= "<<dvd<<endl;

    long long sum=0;
    for(int i=1;i<=n;i++)
        sum=sum+wanted[i];

    long long mult_min=1,mult_max=1e9;

    for(int i=1;i<=n;i++)
    {
        long long up=inp[i].first*mem[i].first/mem[i].second/dvd;

        //cout<<i<<" -> "<<up<<endl;

        mult_max=min(mult_max,up);
    }

    //cout<<dvd<<" "<<mult_max<<" "<<sum<<endl;

    if(mult_max==0)
    {
        printf("-1\n");
        return;
    }

    long long down=wanted[1];

    long long p=sum;
    long long q=dvd;
    long long r=inp[1].second;

    sub(down,p);
    sub(down,q);
    sub(down,r);

    long long one=p*q*r;

    printf("%lld %lld\n",one*1,one*mult_max);
}

int main()
{

    freopen("alchemy.in","r",stdin);
    freopen("alchemy.out","w",stdout);

    int t;
    scanf("%i",&t);

    while(t)
    {
        t--;
        solve();
    }

    return 0;
}