#include<bits/stdc++.h>

#define ll long long
#define pi pair<ll,ll>
#define vi vector<ll>
#define cpy(x,y,s) memcpy(x,y,sizeof(x[0])*(s))
#define mset(x,v,s) memset(x,v,sizeof(x[0])*(s))
#define all(x) begin(x),end(x)
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ary array
#define eb emplace_back
#define IL inline
#define For(i,j,k) for(ll i=(j);i<=(k);i++)
#define Fol(i,k,j) for(ll i=(k);i>=(j);i--)

using namespace std;

#define inf 0x3f3f3f3f3f3f3f3f
#define N 500005
#define M 13005
#define K 105
#define mod 998244353

ll read(){
    ll x=0,f=1;char ch=getchar();
    while(ch<'0' || ch>'9')f=(ch=='-'?-1:f),ch=getchar();
    while(ch>='0' && ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
    return x*f;
}
void write(ll x){
    if(x<0)x=-x,putchar('-');
    if(x/10)write(x/10);
    putchar(x%10+'0');
}

void debug(auto &&...x){
    ((cerr<<x<<' '),...);
    cerr<<'\n';
}

IL ll pls(ll x,ll y){return (x+y>=mod?x+y-mod:x+y);}
IL ll sub(ll x,ll y){return (x-y<0?x-y+mod:x-y);}
IL void Add(ll &x,ll y){x=pls(x,y);}
IL void Dec(ll &x,ll y){x=sub(x,y);}
IL ll mul(ll x,ll y){return x*1ll*y%mod;}

ll a[N],b[N],f[M][K],g[M][K],C[M];
ll c[K];

void solve(){
    ll n=read(),m=read(),maxn=0;
    For(i,1,n)a[i]=read();
    For(i,1,n)b[i]=read(),maxn=max(maxn,a[i]+b[i]),C[b[i]]=max(C[b[i]],a[i]);
    ll k=read();
    For(i,1,k)c[i]=read();
    For(i,0,m+2*k)For(j,0,k)f[i][j]=inf,g[i][j]=0;
    f[0][0]=0;g[0][0]=1;
    ll res=inf,coef=0;
    //debug(maxn);
    For(i,0,m+2*k)For(j,0,k){
        if(!g[i][j])continue;
        ll flag=0,ext=0;
        //debug(i,j,f[i][j],g[i][j]);
        For(l,1,k){
            if(C[l+i])ext=max(ext,C[l+i]+(l+i)),flag=1;
            ll val=(ext>maxn?ext-maxn:0);
            if(f[l+i][max(val,j)]==f[i][j]+c[l])Add(g[l+i][max(val,j)],g[i][j]);
            else if(f[l+i][max(val,j)]>f[i][j]+c[l])g[l+i][max(val,j)]=g[i][j],f[l+i][max(val,j)]=f[i][j]+c[l];
            if(flag)ext++;
        }
        if(i>=maxn && i-maxn>=j){
            //debug(i,j,f[i][j]);
            if(f[i][j]==res)Add(coef,g[i][j]);
            else if(f[i][j]<res)res=f[i][j],coef=g[i][j];
        }
    }
    write(res);putchar(' ');write(coef);putchar('\n');
    For(i,1,n)C[b[i]]=0;
}

int main(){
    #ifdef EAST_CLOUD
    freopen("a.in","r",stdin);
    //freopen("a.out","w",stdout);
    #endif

    ll T=read();while(T--)solve();
    return 0;
}