感觉思路没问题。

 
#include <bits/stdc++.h>
#define f(c,a,b) for(c=a;c<=b;++c)
#define fd(c,a,b)for(c=b;c>=a;--c)
#define ll unsigned long long
#define int long long
#define mp make_pair
#define il inline
#define ri register
#define co const
using namespace std;
const int N=1e6+5;
int n,m,k,i,j;
 
il int read() {
	ri int ans=0;
	ri char c=getchar();
	ri bool neg=0;
	while(!isdigit(c)) neg|=(c=='-'),c=getchar();
	while(isdigit(c)) ans=(ans<<3)+(ans<<1)+c-48,c=getchar();
	return neg?-ans:ans;
}
il void write(ri int x) {
	if(x<0)x=-x,putchar('-');
	if(x>9)write(x/10);
	putchar(x%10+'0');
}
il void writes(ri int x){write(x);putchar(' ');}
il void writed(ri int x){write(x);putchar('\n');}
int a[N],v[N];
il void solve(){
    n=read(),k=read(),m=read();
	f(i,1,n) a[i]=read();
	f(i,1,k) v[i]=read();
	int res=0;
	int pos=min(n*2+1,m-1);
	int fen=0;
	f(j,0,pos){
		res=0;
		f(i,1,n){
			res+=(a[i]==i);
		}
		if(j)
		f(i,1,v[(j-1)%k+1]){
			++a[i];
		}
		fen=max(fen,res+(m-j-1)/2);
	}
	writed(fen);
    return;
}
 
signed main() {
	ri int t=read();
	++t;
	while(--t) solve();
	return 0;
}