#include <iostream>
#include <vector>
using namespace std;
#define next next_v
int N, V, C;
int dp[51][301];
vector<int> next[301];
vector<int> cost[301];
vector<int> weight[301];
int main() {
  cin >> N >> C >> V;
  vector<int> S(V), T(V), Y(V), M(V);
  for(int i = 0; i < V; i++) cin >> S[i];
  for(int i = 0; i < V; i++) cin >> T[i];
  for(int i = 0; i < V; i++) cin >> Y[i];
  for(int i = 0; i < V; i++) cin >> M[i];
  for(int i = 0; i < V; i++) {
    next[S[i]-1].push_back(T[i] - 1);
    cost[S[i]-1].push_back(Y[i]);
    weight[S[i]-1].push_back(M[i]);
  }
  for(int i = 0; i < N; i++) for(int j = 0; j <= C; j++) dp[i][j] = -1;
  dp[0][C] = 0;
  for(int i = 0; i < N; i++) {
    for(int j = 0; j <= C; j++) {
      if(dp[i][j] == -1) continue;
      for(int c = 0; c < next[i].size(); c++) {
        int nc = j - cost[i][c], nw = dp[i][j] + weight[i][c];
        if(nc >= 0) {
          if(dp[next[i][c]][nc] == -1 || dp[next[i][c]][nc] > nw)
            dp[next[i][c]][nc] = nw;
        }
      }
    }
  }
  int ret = -1;
  for(int i = 0; i <= C; i++) {
    if(dp[N - 1][i] >= 0) {
      if(ret == -1 || ret > dp[N - 1][i]) ret = dp[N - 1][i];
    }
  }
  cout << ret << endl;
}