#include<bits/stdc++.h>
using namespace std;const int N=2e5+10;
int t,n,k,d,a[N],v[N],i;
int main(){
	cin>>t;while(t--){
		cin>>n>>k>>d;for(i=1;i<=n;++i)cin>>a[i];
		for(i=0;i<k;++i)cin>>v[i];int ans=0;
		for(i=0;i<min(2*n,d);++i){
			int j=i%k,res=0,p;
			for(p=1;p<=n;++p)if(a[p]==p)res++;
			ans=max(ans,res+(d-i-1)/2);
			for(p=1;p<=v[j];++p)a[p]++;
		}cout<<ans<<endl;
	}
}