#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i=0;i<(int)(n);i++)

int n,m,w;
vector<ll> a(7),b(7),c(7),d(7);
set<int> st;
ll dfs(int ct,int nw,ll nv){
	ll rt=nv;
	rep(i,n){
		if(!((ct>>i)&1)){
			if(nw+a.at(i)>w) continue;
			int nx=(ct|(1<<i));
			if(st.count(nx)) continue;
			st.insert(nx);
			rt=max(rt,dfs(nx,nw+a.at(i),nv+b.at(i)));
		}
	}
	rep(i,m){
		if(!((ct>>(i+n))&1)){
			if(nw-c.at(i)<0) continue;
			int nx=(ct|(1<<(i+n)));
			if(st.count(nx)) continue;
			st.insert(nx);
			rt=max(rt,dfs(nx,nw-c.at(i),nv-d.at(i)));
		}
	}
	return rt;
}

int main(){
	cin>>n>>m>>w;
	rep(i,n) cin>>a.at(i);
	rep(i,n) cin>>b.at(i);
	rep(i,m) cin>>c.at(i);
	rep(i,m) cin>>d.at(i);
	cout<<dfs(0,0,0)<<endl;
}