#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
using namespace std;

#define INF 1000000000

int N,C,V;
int dp[51][301];
vector<vector<vector<int>>> map;
int ret;

//int recursive(int cur_node, int cur_cost) {
//    int min_dist = INF;
//    if (memo[cur_node][cur_cost] != INF) return memo[cur_node][cur_cost];
//    if (cur_node == N) return 0;
//    for (int i = 0; i < map[cur_node].size(); i++) {
//        if ((cur_cost+map[cur_node][i][2]) > C) continue;
//        int min_dist_tmp = recursive(map[cur_node][i][0], cur_cost+map[cur_node][i][2])+map[cur_node][i][1];
//        min_dist = min(min_dist, min_dist_tmp);
//    }
//    memo[cur_node][cur_cost] = min_dist;
//    return min_dist;
//}

int main() {
    cin >> N >> C >> V;
    vector<int> S(V);
    vector<int> T(V);
    vector<int> Y(V);
    vector<int> M(V);
    map.resize(V+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 n = 0; n <= N; n++)
        for (int c = 0; c <= C; c++) { dp[n][c] = INF; }
    for (int c = 0; c <= C; c++) { dp[1][c] = 0; }
    for (int i = 0; i < V; i++) {
        vector<int> v = vector<int>{T[i],M[i],Y[i]};
        map[S[i]].push_back(v);
    }
    
    for (int n = 1; n <= N; n++)
        for (int c = 0; c <= C; c++)
            if (dp[n][c] != INF)
                for (int i = 0; i < map[n].size(); i++)
                    if (c+map[n][i][2]<=C)
                        dp[map[n][i][0]][c+map[n][i][2]] =
                        min(dp[map[n][i][0]][c+map[n][i][2]], dp[n][c]+map[n][i][1]);
    
//    int ret = recursive(1, 0);
    ret = dp[N][C];
    if (ret == INF) ret = -1;
    cout << ret << endl;
    return 0;
}