#include <bits/stdc++.h>

using namespace std;

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);

int dp[51][310];

int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(false);

  int N, C, V;
  cin >> N >> C >> V;
  VI S(V), T(V), Y(V), M(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];
  VVI G(N+1);
  for(int i=0;i<V;++i)
	G[S[i]].PB(i);

  fill((int*)dp, (int*)dp+51*310, 1e9);
  dp[1][0] = 0;
  for(int c=0;c<=C;++c){
	for(int i=1;i<=N;++i){
	  for(int idx: G[i]){
		if(c + Y[idx] > C) continue;
		dp[T[idx]][c+Y[idx]] = min(dp[T[idx]][c+Y[idx]], M[idx]+dp[i][c]);
	  }
	}
  }

  int ans = 1e9;
  REP(c,C+1) ans = min(ans, dp[N][c]);
  cout << (ans >= 1e9? -1: ans) << endl;

  return 0;
}