#include<iostream>
#include<set>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<map>
#include<numeric>
#include<queue>
#include<cmath>
#include <unordered_set>
using namespace std;
typedef long long ll;
const ll INF=1LL<<60;
typedef pair<ll,int> P;
typedef pair<int,P> PP;
const ll MOD=1e9+7;

int main(){
    int N,M,W;
    cin>>N>>M>>W;

    vector<ll> A(N),B(N),C(M),D(M);
    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<M;i++){
        cin>>C[i];
    }
    for(int i=0;i<M;i++){
        cin>>D[i];
    }

    vector<vector<ll>> Weight((1<<N),vector<ll>(1<<M,0));

    for(int Sn=0;Sn<(1<<N);Sn++){
        
        for(int Sm=0;Sm<(1<<M);Sm++){
            ll sumw=0;

            for(int i=0;i<N;i++){
                if((Sn>>i)&1){
                    sumw+=A[i];
                }
            }


            for(int i=0;i<M;i++){
                if((Sm>>i)&1){
                    sumw-=C[i];
                }
            }

            Weight[Sn][Sm]=sumw;
        }
    }

    vector<vector<ll>> dp((1<<N),vector<ll>(1<<M,-INF));

    dp[0][0]=0;

    for(int Sn=0;Sn<(1<<N);Sn++){
        for(int Sm=0;Sm<(1<<M);Sm++){

            if(Weight[Sn][Sm]<0 || Weight[Sn][Sm]>W) continue;
            /*
            ll sumv=0;
            for(int i=0;i<N;i++){
                if((Sn>>i)&1){
                    sumv+=B[i];
                }
            }


            for(int i=0;i<M;i++){
                if((Sm>>i)&1){
                    sumv-=D[i];
                }
            }
            */

            
            for(int i=0;i<N;i++){
                
                if( ((Sn>>i)&1) ==0  && 0<=(Weight[Sn][Sm] + A[i]) && (Weight[Sn][Sm] + A[i])<=W ){

                    dp[Sn|(1<<i)][Sm]=max(dp[Sn|(1<<i)][Sm],dp[Sn][Sm]+B[i]);
                
                }
                
            }


            for(int j=0;j<M;j++){
                
                if( ((Sm>>j&1)) ==0  && 0<=(Weight[Sn][Sm] - C[j]) && (Weight[Sn][Sm] - C[j])<=W ){

                    dp[Sn][Sm|(1<<j)]=max(dp[Sn][Sm|(1<<j)],dp[Sn][Sm]-D[j]);
                
                }
                
            }

            for(int i=0;i<N;i++){

                for(int j=0;j<M;j++){

                    if( ((Sn>>i)&1)==0 && ((Sm>>j)&1)==0  ){

                
                        if( 0<=(Weight[Sn][Sm] + A[i]-C[j]) && (Weight[Sn][Sm] + A[i]-C[j])<=W ){

                            dp[Sn|(1<<i)][Sm|(1<<j)]=max(dp[Sn|(1<<i)][Sm|(1<<j)],dp[Sn][Sm]+B[i]-D[j]);
                        

                        }

                    }
                }
                
            }

          

        }
    }

    ll ans=-INF;
    for(int Sn=0;Sn<(1<<N);Sn++){
        for(int Sm=0;Sm<(1<<M);Sm++){
            ans=max(ans,dp[Sn][Sm]);
        }
    }

    cout<<ans<<endl;

}