#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

const int INF = 1e6;
int N, C, V;
int dp[1501][301];

int main() {
    cin >> N >> C >> V;
    vector<int> S(V), T(V), Y(V), M(V);
    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<1501; ++i) {
        for (int j=0; j<=C; ++j) {
            dp[i][j] = INF;
        }
    }
    dp[1][0] = 0;
    for (int k=0; k<V; ++k) {
        for (int i=0; i<V; ++i) {
            for (int j=0; j+Y[i]<=C; ++j) {
                dp[T[i]][j+Y[i]] = min(dp[T[i]][j+Y[i]], dp[S[i]][j]+M[i]);
            }
        }
    }
    int ans = INF;
    for (int i=0; i<=C; ++i) {
        ans = min(ans, dp[N][i]);
    }
    cout << (ans == INF ? -1 : ans) << endl;
    return 0;
}