#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i=0;i<(n);++i)
#define loop for(;;)
#define trace(var) cerr<<">>> "<<#var<<" = "<<var<<endl;
#define all(v) begin(v),end(v)
#define pb push_back
#define inf (1e9)
#define eps (1e-9)
using Integer = long long;
using Real = long double;
const Real PI = acosl(-1);
using P = pair<int, int>;

template<class S, class T> inline
ostream& operator<<(ostream&os, pair<S,T> p) {
  return os << '(' << p.first << ", " << p.second << ')';
}

template<class S, class T> inline
ostream& operator<<(ostream&os, tuple<S,T> t) {
  return os << '('
    << get<0>(t) << ", "
    << get<1>(t) << ')';
}

template<class S, class T, class U> inline
ostream& operator<<(ostream&os, tuple<S,T,U> t) {
  return os << '('
    << get<0>(t) << ", "
    << get<1>(t) << ", "
    << get<2>(t) << ')';
}

template<class T> inline
ostream& operator<<(ostream&os, set<T> v) {
  os << "(set";
  for (T item: v) os << ' ' << item;
  os << ")";
  return os;
}

template<class T> inline
ostream& operator<<(ostream&os, vector<T> v) {
  if (v.size() == 0) { return os << "(empty)"; }
  os << v[0];
  for (int i=1, len=v.size(); i<len; ++i) os << ' ' << v[i];
  return os;
}

template<class T> inline
istream& operator>>(istream&is, vector<T>&v) {
  rep (i, v.size()) is >> v[i];
  return is;
}

//           ^   >  v   <
int dx[] = { -1, 0, 1,  0 };
int dy[] = {  0, 1, 0, -1 };

using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
using vvd = vector<vd>;
using vb = vector<bool>;

int table[50][301];

int main() {

  int n, c, v; cin >> n >> c >> v;
  vi ss(v), ts(v), ys(v), ms(v);
  cin >> ss >> ts >> ys >> ms;

  rep (i, v) {
    ss[i]--;
    ts[i]--;
  }

  vvi rev(n);
  rep (i, v) {
    rev[ss[i]].push_back(i);
  }

  rep (i, 50) rep (j, 301) table[i][j] = inf;
  table[0][c] = 0;

  rep (u, n) {
    rep (k, c+1) {
      if (table[u][k] == inf) continue;
      for (int i: rev[u]) {
        int v = ts[i];
        int y = ys[i]; // cost
        int m = ms[i]; // time
        if (k-y<0) continue;
        table[v][k-y] = min( table[v][k-y], table[u][k] + m);
      }
    }
  }

  int ans = -1;
  rep (k, c+1) {
    if (table[n-1][k]<inf and (ans == -1 or ans > table[n-1][k]))
      ans=table[n-1][k];
  }
  cout << ans << endl;

  return 0;
}