#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <cmath>
#include <atcoder/all>
#include <tuple>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < int(n);i++)

int dp[51][301];
struct Edge{
  int to,time,cost;
};
int main(){
  int n,c,v;
  cin >> n >> c >> v;
  vector<int> s(v);
  vector<int> t(v);
  vector<int> y(v);
  vector<int> m(v);
  vector<vector<Edge>> g(n);
  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){
    Edge x;
    x.to = t[i]-1;
    x.time = m[i];
    x.cost = y[i];
    g[s[i]-1].push_back(x);
  }
  for (int i = 0; i < n;i++){
    for (int j = 0; j <= c;j++){
      dp[i][j] = 1e9;
    }
  }
  dp[0][c] = 0;
  for (int i = 0; i < n;i++){
    for (int j = c; j >= 0;j--){
      for (auto ex:g[i]){
        if (j-ex.cost < 0) continue;
        //printf("(to,j-cost) = (%d,%d)\n",ex.to,j-ex.cost);
        //cout << endl;
        dp[ex.to][j-ex.cost] = min(dp[ex.to][j-ex.cost],dp[i][j]+ex.time);
      }
    }
  }  
  int ans = 1e9;
  for (int i = 0; i <= c;i++){
    if (dp[n-1][i] < ans) ans = dp[n-1][i];
  }
  if (ans == 1e9) ans = -1; 
  cout << ans << endl;

  //for (int i = 0; i < n;i++){
  //  for (int j = 0; j <= 10; j++){
  //    if (dp[i][j] >= 1e9) cout << "F "; 
  //    else cout << dp[i][j] << " ";
  //  }
  //  cout << endl;
  //}

  
  return 0;
}