#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <iostream>
#include <algorithm>
#include <functional>
#include <numeric>
#include <string>

#define MAX_N 50
#define MAX_C 300
#define MAX_V 1500

using namespace std;

struct edge
{
    int to;
    int cost;
    int time;
};


int main(void)
{
    int n, c, v, s[MAX_V], t[MAX_V], y[MAX_V], m[MAX_V];
    cin >> n >> c >> v;
    vector<edge> g[MAX_N + 1];
    for (int i = 0; i < v; i++)
        cin >> s[i];
    for (int i = 0; i < v; i++)
        cin >> t[i];
    for (int i = 0; i < v; i++)
        cin >> y[i];
    for (int i = 0; i < v; i++)
        cin >> m[i];
    for (int i = 0; i < v; i++) {
        edge e;
        e.to = t[i]; e.cost = y[i]; e.time = m[i];
        g[s[i]].push_back(e);
    }
    int dp[MAX_N + 1][MAX_C + 1];
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j <= c; j++) {
            dp[i][j] = -1;
        }
    }
    dp[1][c] = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j <= c; j++) {
            if (dp[i][j] != -1) {
                for (int k = 0; k < g[i].size(); k++) {
                    edge e = g[i][k];
                    if (e.cost <= j && (dp[e.to][j - e.cost] == -1 || dp[e.to][j - e.cost] > dp[i][j] + e.time)) {
                        dp[e.to][j - e.cost] = dp[i][j] + e.time;
                    }
                }
            }
        }
    }
    int ret = INT_MAX;
    for (int i = 0; i <= c; i++) {
        if (dp[n][i] != -1) {
            ret = min(ret, dp[n][i]);
        }
    }
    if (ret == INT_MAX) {
        ret = -1;
    }
    printf("%d\n", ret);
    return 0;
}