#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
using ll=long long;
using pii=pair<int,int>;
using vi=vector<int>;
using vl=vector<ll>;
#define pb push_back
#define all(a) begin(a),end(a)

const int N=30010,MOD=998244353,K=110;
const char en='\n';
const ll LLINF=1ll<<60;

int add(int a,int b)
{
	if (a+b>=MOD) return a+b-MOD;
	return a+b;
}

pair<ll,int> mer(pair<ll,int> a,pair<ll,int> b)
{
	if (a.x==b.x) return {a.x,add(a.y,b.y)};
	else return min(a,b);
}

int t,n,m,k;
pair<ll,int> dp[N][2*K];
ll maa[N],su[N],co[K],a[N*20],b[N*20];

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin>>t;
	while (t--)
	{
		cin>>n>>m;
		for (int i=0;i<=2*m+2*K;++i)
		{
			maa[i]=0;
			for (int j=0;j<K;++j) dp[i][j]=pair<ll,int>(LLINF,0);
		}
		ll maxb=0;
		for (int i=0;i<n;++i) cin>>a[i];
		for (int i=0;i<n;++i) cin>>b[i];
		for (int i=0;i<n;++i)
		{
			maa[b[i]]=max(maa[b[i]],a[i]);
			maxb=max(maxb,b[i]);
		}
		cin>>k;
		for (int i=1;i<=k;++i) cin>>co[i];
		ll mas=0;
		for (int i=1;i<=2*m+2*k;++i)
		{
			if (i<=maxb) mas=max(mas,i+maa[i]);
			su[i]=mas-i;
		}
		dp[0][0]={0,1};
		pair<ll,int> an={LLINF,0};
		for (int i=0;i<=2*m+2*k;++i) for (int j=0;j<2*k;++j) if (dp[i][j].x!=LLINF)
		{
			//cout<<i<<' '<<j<<' '<<dp[i][j].x<<' '<<dp[i][j].y<<endl;
			ll po=j+su[i],re=0;
			if (po<=0 && i>=maxb)
			{
				an=mer(an,dp[i][j]);
				//cout<<an.x<<' '<<an.y<<en;
				continue;
			}
			for (int l=1;l<=k;++l) if (i+l<=2*m+2*k)
			{
				if (maa[i+l]) re=max(re,maa[i+l]);
				int cu=max(re,po-l);
				//cout<<i<<' '<<j<<' '<<l<<' '<<po<<' '<<cu<<' '<<su[i+l]<<' '<<su[i+l]+k<<endl;
				assert(cu>=su[i+l] && cu<=su[i+l]+2*k);
				//if (cu>=su[i+l]+k) continue;
				cu-=su[i+l];
				dp[i+l][cu]=mer(dp[i+l][cu],{dp[i][j].x+co[l],dp[i][j].y});
			}
		}
		cout<<an.x<<' '<<an.y<<en;
	}
}