#include <bits/stdc++.h> 
#pragma GCC optimize("O3,unroll-loops")
#define pb push_back
#define F first
#define pii pair<int,int> 
#define all(a) a.begin(),a.end()
#define S second 
#define sz(a) (int)a.size()
#define rep(i , a , b) for(int i = (a) ; i <= (b) ; i++)
#define per(i , a , b) for(int i = (a) ; i >= (b) ; i--)
#define ld long double
#define int long long 
using namespace std ;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxn = 3e5+20 , maxm = 2e4 + 10, sq = 500 , inf = 1e18+10 , mod =998244353 ; 
int a[maxn] ,b[maxn] , x[maxm]  , c[200];
pii dp[maxn][140] ;

void upd(pii &a , pii b , int c){
    b.F += c; 
    if(a.F > b.F){
        a = b;
    }else if(a.F == b.F){
        a.S += b.S ;
        if(a.S >= mod)a.S-= mod ; 
    }
}

signed main(){
    ios_base::sync_with_stdio(false) ; cin.tie(0) ;
    int T ;
    cin >> T ;
    while(T--){
        int n , m ;
        cin >> n >> m ; 
        rep(i ,1, n){
            cin >> b[i] ;
        }
        int sm =0 ;
        rep(i ,1, n){
            cin >> a[i] ;
            sm = max(sm , a[i]+b[i]) ;
        }
        int k ;
        cin>> k ; 
        rep( i,1 ,k){
            cin >> c[i] ;
        }
        rep(i ,1, 2*m){
            x[i] = inf; 
        }
        rep(i ,1 ,n){
            x[b[i]] = min(x[b[i]] , b[i] + (sm-a[i]-b[i])) ;
        }
        rep(i , 0, sm+2*k)rep(j , 0, k){
            dp[i][j] = {inf,0} ;
        }
        dp[0][0] = {0,1} ;
        rep(i , 0 ,sm+2*k){
            rep(j , 0 ,k){
                int mn = inf ;
                rep(z , 1 ,k){
                    upd(dp[i+z][max(j , i+z-mn)] , dp[i][j], c[z]) ;
                    mn= min(mn , x[i+z]);
                }
            }
        }
        pii ans ;
        ans = {inf , 0} ;
        rep(i , sm , sm+2*k){
            rep(j , 0 ,k){
                if(i-sm >= j){
                    upd(ans , dp[i][j] , 0);
                }
            }
        }
        cout << ans.F << " " << ans.S << "\n"; 
    }
}
/*
 
*/