#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<set>
#define ll long long
using namespace std;
ll rdn()
{ll ret=0;bool fx=1;char ch=getchar();while(ch>'9'||ch<'0'){if(ch=='-')fx=0;ch=getchar();}while(ch>='0'&&ch<='9')ret=ret*10+ch-'0',ch=getchar();return fx?ret:-ret;
}
ll Mx(ll a,ll b){return a>b?a:b;}
const int N=1e5+5;
int n,m,atk[N]; ll a[N],p[N],lm; bool fg;
struct Node{ll a,p;Node(ll a=0,ll p=0):a(a),p(p) {}
};
multiset<ll> st;//multiset not set!!!!!!
ll Mul(ll a,ll b,ll mod)
{ll d=(ll)floor((double)a*b/mod+0.5);ll ret=a*b-d*mod; if(ret<0)ret+=mod; return ret;
}
ll exgcd(ll a,ll b,ll &x,ll &y)
{if(!b){x=1;y=0;return a;}ll ret=exgcd(b,a%b,y,x); y-=a/b*x; return ret;
}
void init()
{for(int i=1;i<=n;i++)a[i]=rdn();for(int i=1;i<=n;i++)p[i]=rdn()/*,a[i]%=p[i]*/;//for setfor(int i=1;i<=n;i++)atk[i]=rdn();st.clear(); lm=0;/for(int i=1,d;i<=m;i++)d=rdn(),st.insert(d);multiset<ll>::iterator it,it2;ll d,x,y;for(int i=1;i<=n;i++){it=st.upper_bound(a[i]);///for here <ll> not <int>if(it!=st.begin())it--;d=(*it); st.erase(it); st.insert(atk[i]);ll g=exgcd(d,p[i],x,y);a[i]/=g; p[i]/=g; d/=g;///
      lm=Mx(lm,(ll)ceil((double)a[i]/d));//
      a[i]=Mul(a[i],x,p[i]);///
    }
}
Node cal(Node u,Node v)
{ll a=u.p, b=v.p, r=v.a-u.a, x,y;ll g=exgcd(a,b,x,y);if(r%g){ fg=1;return Node(0,0);}a/=g; b/=g; r/=g;x=Mul(x,r,b);///y=a*b*g; x=(u.a+Mul(x,u.p,y))%y;return Node(x,y);
}
int main()
{freopen("dragon.in","r",stdin);freopen("dragon.out","w",stdout);int T=rdn();while(T--){n=rdn();m=rdn(); fg=0; init();if(fg){puts("-1");continue;}Node cr=Node(a[1],p[1]);if(fg){puts("-1");continue;}for(int i=2;i<=n;i++){cr=cal(cr,Node(a[i],p[i]));if(fg){ puts("-1");break;}}if(fg)continue;if(cr.a<lm){ll k=ceil((double)(lm-cr.a)/cr.p);cr.a+=k*cr.p;}if(!fg)printf("%lld\n",cr.a);}return 0;
}