#include <bits/stdc++.h>

using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i,n) for (int i = (int)(n-1); i >= 0; --i)
#define Rep(i,a,b) for (int i = a; i < b; ++i)
#define rRep(i,a,b) for (int i = a; i > b; --i)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define Bit(x,i) (((x)>>(i))&1)
using ll = long long;
using vi = vector<int>;
using vll = vector<long long>;
using vvi = vector<vi>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
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 (b<a) { a=b; return 1; } return 0; }
const double PI = acos(-1);
const int INF = 1e9+2;
const ll LINF = 3e18;

ll S[2000], T[2000], Y[2000], M[2000];
vvll dp(55, vll(310, LINF));
vector<vector<pll>> G(55);

int main() {
  int N; cin >> N;
  int C; cin >> C;
  int V; cin >> V;
  rep(i, V) cin >> S[i];
  rep(i, V) cin >> T[i];
  rep(i, V) cin >> Y[i];
  rep(i, V) cin >> M[i];
  rep(i, V) G[S[i]-1].push_back({T[i]-1, i});
  dp[0][0] = 0;
  rep(i, N) {
    fore(nx, G[i]) {
      rep(j, C+1) {
        if(j + Y[nx.second] <= C) chmin(dp[nx.first][j + Y[nx.second]], dp[i][j] + M[nx.second]);
      }
    }
  }
  ll ans = LINF;
  rep(j, C+1) {
    chmin(ans, dp[N-1][j]);
  }
  if(ans == LINF) cout << -1 << endl;
  else cout << ans << endl;
}