#include <bits/stdc++.h>
using namespace std;

int INF = 1e8;
int dp[100][400];

int main() {
    ios::sync_with_stdio(false);
    int n, c, v; 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 < 100; i++)
        for (int j = 0; j < 400; j++)
            dp[i][j] = INF;
    
    dp[1][c] = 0;

    for (int i = 1; i <= n; i++) {
        for (int j = c; j >= 0; j--) {
            if (dp[i][j] != INF) {
                for (int k = 0; k < v; k++) {
                    if (i == s[k] && j - y[k] >= 0) {
                        dp[t[k]][j - y[k]] = min(dp[i][j] + m[k], dp[t[k]][j - y[k]]);
                    }
                }
            }
        }
    }
    int ans = INF;
    for (int i = 0; i < 400; i++)
        ans = min(ans, dp[n][i]);
    
    if (ans >= INF)
        cout << -1 << endl;
    else
        cout << ans << endl;

    return 0;
}