typedef long long ll;
typedef long double ld;
#include <bits/stdc++.h>
using namespace std;
#define int long long

signed main(){
    ll n,m,w;
    std::cin >> n>>m>>w;
    vector<ll> a(n),b(n);
    for (int i = 0; i < n; i++) {
        std::cin >> a[i];
    }
    for (int i = 0; i < n; i++) {
        std::cin >> b[i];
    }
    vector<ll> c(m),d(m);
    for (int i = 0; i < m; i++) {
        std::cin >> c[i];
    }
    for (int i = 0; i < m; i++) {
        std::cin >> d[i];
    }
    vector<vector<vector<ll>>> dp(n+1,vector<vector<ll>>(w+1,vector<ll>(1<<m)));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j <= w; j++) {
            for (int k = 0; k < 1<<m; k++) {
                dp[i+1][j][k] = max(dp[i+1][j][k], dp[i][j][k]);
                if(j-a[i]<0)continue;
                ll normal = max(dp[i][j][k],dp[i][j-a[i]][k]+b[i]);
                // dp[i+1][j][k] = max(dp[i][j][k],dp[i][j-a[i]][k]+b[i]);
                for (int t = 0; t < 1<<m; t++) {
                    if((k&t)!=0)continue;
                    ll sumc = 0;
                    ll sumd = 0;
                    for (int ii = 0; ii < m; ii++) {
                        if(t&(1<<ii)){
                            sumc += c[ii];
                            sumd += d[ii];
                        }
                    }
                    if(j-sumc>=0)dp[i+1][j-sumc][k|t] = max(dp[i+1][j-sumc][k|t],normal-sumd);
                }
            }
        }
    }
    ll ans = 0;
    for (int i = 0; i <= w; i++) {
        for (int j = 0; j < 1<<m; j++) {
            ans = max(ans, dp[n][i][j]);
        }
    }
    std::cout << ans << std::endl;
}