#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;
using Graph = vector<vector<pair<int,P>>>; 
const int INF = 1e9;

int dp[55][310];

void init() {
  rep(i,55) rep(j,310) dp[i][j] = INF;
}

int main(){
  int n,C,V;
  cin >> n >> C >> V;
  vector<int> S(V), T(V),Y(V),M(V);
  rep(i,V) cin >> S[i], S[i]--;
  rep(i,V) cin >> T[i], T[i]--;
  rep(i,V) cin >> Y[i];
  rep(i,V) cin >> M[i];
  Graph G(n);
  rep(i,V){
    G[S[i]].push_back({T[i],{Y[i],M[i]}});
  } 
  init();

  dp[0][0] = 0;

  for (int u = 0; u < n; u++) {
    for (int c = 0; c <= C; c++) {
      for (auto p : G[u]) {
        int v = p.first;
        int cost = p.second.first;
        int t = p.second.second;
        if (c - cost >= 0 ) {
          dp[v][c] = min(dp[v][c],dp[u][c - cost] + t);
        }
      }
    }
  }

  int res = INF;
  rep(i,C+1) {
    res = min(res,dp[n-1][i]);
  }
  cout << (res == INF ? -1 : res) << endl;
  return 0;
}