#include <bits/stdc++.h>
// #include <atcoder/all>
// #include "icld.cpp"
using namespace std;
using ll = long long int;
using vi = vector<int>;
using si = set<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using ss = string;
using db = double;
template<typename T> using minpq = priority_queue <T,vector<T>,greater<T>>;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
#define V vector
#define P pair<int,int>
#define PLL pair<ll,ll>
#define rep(i,s,n) for(int i=(s);i<(int)(n);i++)
#define rev(i,s,n) for(int i=(s);i>=(int)(n);i--)
#define reciv(v,n) vll (v)((n)); rep(i,0,(n))cin>>v[i]
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define ci(x) cin >> x
#define cii(x) ll x;cin >> x
#define cci(x,y) ll x,y;cin >> x >> y
#define co(x) cout << x << endl
#define pb push_back
#define eb emplace_back
#define rz resize
#define pu push
#define sz(x) int(x.size())
#define vij v[i][j]
// ll p = 1e9+7;
// ll p = 998244353;
// n do -> n*pi/180
#define yn cout<<"Yes"<<endl;else cout<<"No"<<endl
#define YN cout<<"YES"<<endl;else cout<<"NO"<<endl
template<class T>void chmax(T &x,T y){x=max(x,y);}
template<class T>void chmin(T &x,T y){x=min(x,y);}

struct ed{
  int to,tm,mn;
  ed(int to,int tm,int mn):to(to),tm(tm),mn(mn){}
};

int main(){
  cci(n,c);
  cii(m);
  
  vvi tb(4,vi(m));
  rep(i,0,4){
    rep(j,0,m)ci(tb[i][j]);
  }

  V<V<ed>> v(n);
  rep(i,0,m){
    int fr=tb[0][i]-1;
    int nx=tb[1][i]-1;
    int M=tb[2][i];
    int T=tb[3][i];

    v[fr].eb(nx,T,M);
  }

  V<V<P>> dp(n);
  dp[0].pb(P(0,0));

  queue<int>q;
  q.pu(0);
  while(sz(q)){
    int x=q.front();q.pop();
    int dist,money;

    for(ed e:v[x]){
      for(P np:dp[x]){
        tie(dist,money)=np;

        if(money+e.mn>c)continue;

        dp[e.to].pb(P(dist+e.tm,money+e.mn));
        q.pu(e.to);
      }
    }
  }

  int ans=1001001001;
  for(P np:dp[n-1])chmin(ans,np.first);
  
  if(ans==1001001001)ans=-1;
  co(ans);
}