#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair < int , int > pii ;
typedef vector < int > vi ;
#define fi first
#define se second
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

const int MAXN = 1e5 + 7 ;

int n ;
ll a[ MAXN ] , p[ MAXN ] , dmg[ MAXN ] ;
ll nw_sword[ MAXN ] ;

ll fst[ MAXN ] ;

ll get_lcm ( ll x , ll y ) {
    ll aux = __gcd ( x , y ) ;
    x /= aux ;
    return x * y ;
}

void printout ( __int128 wtf ) {
    vector < int > v ;
    bool neg = false ;
    if ( wtf < 0 ) { neg = true ; wtf = -wtf ; }
    while ( wtf > 0 ) {
        v.push_back ( wtf % 10 ) ;
        wtf /= 10 ;
    }
    reverse ( v.begin ( ) , v.end ( ) ) ;
    if ( v.empty ( ) == true ) { v.push_back ( 0 ) ; }
    if ( neg == true ) { cout << "-" ; }
    for ( auto x : v ) { cout << x ; }
    cout << "\n" ;
}

pair < __int128 , __int128 > ext_gcd ( __int128 x , __int128 y ) {
    pair < __int128 , __int128 > aux1 = { 1 , 0 } , aux2 = { 0 , 1 } ;
    while ( 1 ) {
        if ( x < y ) { swap ( x , y ) ; swap ( aux1 , aux2 ) ; }
        if ( y == 0 ) { break ; }
        __int128 cnt = x / y ;
        aux1.fi -= cnt * aux2.fi , aux1.se -= cnt * aux2.se ;
        x -= cnt * y ;
    }
    return aux1 ;
}

pair < ll , ll > merge ( ll st1 , ll per1 , ll st2 , ll per2 ) {
    ll foo = __gcd ( per1 , per2 ) ;
    if ( ( st1 % foo ) != ( st2 % foo ) ) { return { -1 , -1 } ; }
    if ( st1 > st2 ) { swap ( st1 , st2 ) ; swap ( per1 , per2 ) ; }
    auto [ hh1 , hh2 ] = ext_gcd ( per1 , per2 ) ;
    __int128 ch1 = ( per2 / foo ) , ch2 = ( per1 / foo ) ;
    __int128 coef = hh1 * ( st2 - st1 ) / foo ;
    if ( coef > 0 ) { coef %= ch1 ; }
    else {
        __int128 rm = ( -coef + ch1 - 1 ) / ch1 ;
        coef += rm * ch1 ;
    }
    __int128 cand = coef * per1 + st1 ;
    return { cand , get_lcm ( per1 , per2 ) } ;
}

void solve ( ) {
    int foo ;
    cin >> n >> foo ;
    for ( int i = 1 ; i <= n ; ++ i ) {
        cin >> a[ i ] ;
    }
    for ( int i = 1 ; i <= n ; ++ i ) {
        cin >> p[ i ] ;
    }
    for ( int i = 1 ; i <= n ; ++ i ) {
        cin >> nw_sword[ i ] ;
    }
    multiset < ll > s ;
    for ( int i = 1 ; i <= foo ; ++ i ) {
        ll x ; cin >> x ;
        s.insert ( x ) ;
    }
    for ( int i = 1 ; i <= n ; ++ i ) {
        auto it = s.upper_bound ( a[ i ] ) ;
        if ( it != s.begin ( ) ) { -- it ; }
        dmg[ i ] = *it ;
        s.erase ( it ) ;
        s.insert ( nw_sword[ i ] ) ;
    }
    ll mn_ops = 0 ;
    for ( int i = 1 ; i <= n ; ++ i ) {
        mn_ops = max ( mn_ops , ( a[ i ] + dmg[ i ] - 1 ) / dmg[ i ] ) ;
        a[ i ] %= p[ i ] ;
        ll aux = __gcd ( p[ i ] , dmg[ i ] ) ;
        if ( ( a[ i ] % aux ) != 0 ) {
            cout << "-1\n" ;
            return ;
        }
        p[ i ] /= aux , dmg[ i ] /= aux , a[ i ] /= aux ;
    }
    ll ori = -1 , per = -1 ;
    for ( int i = 1 ; i <= n ; ++ i ) {
        __int128 aux = a[ i ] ;
        auto [ hh1 , hh2 ] = ext_gcd ( dmg[ i ] , p[ i ] ) ;
        if ( hh1 > 0 ) { hh1 %= p[ i ] ; }
        else {
            hh1 = ( ( -hh1 ) % p[ i ] ) ;
            hh1 = ( p[ i ] - hh1 ) % p[ i ] ;
        }
        aux = ( aux * hh1 ) % p[ i ] ;
        if ( ori == -1 ) {
            ori = aux , per = p[ i ] ;
        }
        else {
            auto [ ret1 , ret2 ] = merge ( ori , per , aux , p[ i ] ) ;
            if ( ret1 == -1 ) {
                cout << "-1\n" ;
                return ;
            }
            ori = ret1 , per = ret2 ;
        }
    }
    if ( mn_ops <= ori ) { cout << ori << "\n" ; }
    else {
        ll diff = mn_ops - ori ;
        diff = ( diff + per - 1 ) / per ;
        cout << ori + diff * per << "\n" ;
    }
}

int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    int t = 1 ; cin >> t ; 
    while ( t -- ) { solve ( ) ; }
    return 0 ;
}