#include <algorithm>
#include <iostream>
#include <vector>
#include <tuple>
using namespace std;
const int INF = (int)1e9 + 7;
template<class T> inline bool chmin(T &a, T b) { return a > b ? (a = b, 1) : 0; }

int main() {
    int n; cin >> n;
    int c; cin >> c;
    vector<vector<tuple<int, int, int>>> g(n); {
        int v; cin >> v;
        vector<int> s(v); for (auto &si: s) cin >> si, si--;
        vector<int> t(v); for (auto &ti: t) cin >> ti, ti--;
        vector<int> y(v); for (auto &yi: y) cin >> yi;
        vector<int> m(v); for (auto &mi: m) cin >> mi;
        for (int i = 0; i < v; i++) {
            g[s[i]].emplace_back(t[i], y[i], m[i]);
        }
    }
    vector<vector<int>> dp(n, vector<int>(c + 1, INF));
    dp[0][0] = 0;
    for (int u = 0; u < n; u++) for (auto &t: g[u]) {
        int v, add, time; tie(v, add, time) = t;
        for (int cost = 0; cost <= c - add; cost++) {
            chmin(dp[v][cost + add], dp[u][cost] + time);
        }
    }
    int ans = *min_element(begin(dp[n - 1]), end(dp[n - 1]));
    if (ans == INF) ans = -1;
    cout << ans << endl;
    return 0;
}