#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <sstream>   // istringstream
#include <algorithm> // sort
#include <utility>   // pair
#include <cfloat>    // DBL_MAX

typedef long long ll;
using namespace std;

const int maxN = 50;
const int maxM = 1000;

struct log {
  int pos;
  int cost;
  int time;
};

int main(){
  ll N,C,V; // [50],[300],[1500]
  cin >> N >> C >> V;

  vector<int> ss(V), ts(V), cs(V), ms(V);
  for(int i=0; i<V; i++){ cin >> ss[i]; }
  for(int i=0; i<V; i++){ cin >> ts[i]; }
  for(int i=0; i<V; i++){ cin >> cs[i]; }
  for(int i=0; i<V; i++){ cin >> ms[i]; }

  queue<struct log> roots;
  struct log tmp = {1,0,0};
  roots.push(tmp);
  int minTime = maxN*maxM;

  while(true){
    if(roots.empty()){ break; }

    struct log crr  = roots.front();

    for(int i=0; i<V; i++){
      if(ss[i]!=crr.pos){ continue; }

      if(crr.cost + cs[i] <= C){
        if(ts[i]==N){ // goal
          minTime = min(minTime, ms[i]+crr.time);
        } else {
          tmp.pos  = ts[i];
          tmp.cost = cs[i]+crr.cost;
          tmp.time = ms[i]+crr.time;
          roots.push(tmp);
        }
      }
    }
    roots.pop();
  }

  //
  if(minTime == maxN*maxM){
    minTime = -1;
  }
  cout << minTime << endl;

  return 0;
}