#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, c, v; cin >> n >> c >> v;
  vector<int> s(v), t(v), y(v), m(v);
  REP(i, v) cin >> s[i], --s[i];
  REP(i, v) cin >> t[i], --t[i];
  REP(i, v) cin >> y[i];
  REP(i, v) cin >> m[i];
  vector<vector<int> > graph(n);
  REP(i, v) graph[s[i]].emplace_back(i);
  vector<vector<int> > dp(n, vector<int>(c + 1, INF));
  dp[0][0] = 0;
  REP(i, n) REP(j, c + 1) {
    for (int idx : graph[i]) {
      if (j + y[idx] <= c) chmin(dp[t[idx]][j + y[idx]], dp[i][j] + m[idx]);
    }
  }
  int ans = *min_element(ALL(dp[n - 1]));
  cout << (ans == INF ? -1 : ans) << '\n';
  return 0;
}