#include <iostream>
#include <algorithm>
#include <vector>
#include <map>

#define REP(a, b) for(int a=0; a<(int)b; a++)

using namespace std;

int main(){
  int N, C, V;
  vector <int> S, T, Y, M;
  map <int, map<int, vector<pair<int, int> > > > keiro; 
  
  cin >> N >> C >> V;
  S.resize(V);
  T.resize(V);
  Y.resize(V);
  M.resize(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)
	keiro[S[i]][T[i]].push_back(pair<int, int>(Y[i], M[i]));

  int A[N+1][C+1];
  REP(i, N+1){
	REP(j, C+1){
	  A[i][j] = 0;
	}
  }
  
  for(int i=1; i<N; i++){
	for(int j=i+1; j<=N; j++){
	  if(keiro[i].find(j) != keiro[i].end()){
		REP(l, keiro[i][j].size()){
		  int money = keiro[i][j][l].first, time = keiro[i][j][l].second;
		  for(int k=0; k <= (C-money); k++){
			if(A[i][k+money]==0 && i!=1) break;
			A[j][k] = (A[j][k]==0)? A[i][k+money]+time : min(A[j][k], A[i][k+money]+time);
		  }
		}
	  }
	}
  }
  
  int min_time = -1;
  REP(i, C+1){
	if(A[N][i]==0) continue;
	min_time = (min_time==-1) ? A[N][i] : min(A[N][i], min_time);
  }
	
  cout << min_time << endl;

  return 0;
}