#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N,M,W;
int A[14],B[14];
ll dp[1<<14];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>M>>W;
	FOR(i,N) cin>>A[i];
	FOR(i,N) cin>>B[i];
	FOR(i,M) {
		cin>>x;
		A[N+i]=-x;
	}
	FOR(i,M) {
		cin>>x;
		B[N+i]=-x;
	}
	
	FOR(i,1<<14) dp[i]=-1LL<<60;
	dp[0]=0;
	
	int mask;
	ll ma=0;
	FOR(mask,1<<(N+M)) {
		ll sum=0;
		FOR(i,N+M) if(mask&(1<<i)) sum+=A[i];
		if(sum<0||sum>W) continue;
		ma=max(ma,dp[mask]);
		FOR(i,N+M) if((mask&(1<<i))==0&&sum+A[i]>=0&&sum+A[i]<=W) dp[mask|(1<<i)]=max(dp[mask|(1<<i)],dp[mask]+B[i]);
		
		
	}
	cout<<ma<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}