#include <cassert>
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)

#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define pii pair<int, int>
#define vi vector<int>

using namespace std;
template <class S, class T>
ostream& operator<<(ostream& o, const pair<S, T>& p)
{
    return o << "(" << p.first << "," << p.second << ")";
}
template <class T>
ostream& operator<<(ostream& o, const vector<T>& vc)
{
    o << "sz = " << vc.size() << endl
      << "[";
    for (const T& v : vc)
        o << v << ",";
    o << "]";
    return o;
}
typedef long long ll;

#define NMAX 51
#define MAX 101
#define CMAX 301

int N, C, V;
int S[MAX];
int T[MAX];
int Y[MAX];
int M[MAX];

int data[NMAX][CMAX];
struct edge {
    int to;
    int cost;
    int tim;
};
vector<edge> edges[NMAX];

void dfs(int start)
{
    for (const auto& i : edges[start]) {
        const int to = i.to;
        const int cost = i.cost;
        const int tim = i.tim;
        FOR(c, cost, C + 1)
        {
            if (data[to][c] == -1) {
                if (data[start][c - cost] != -1) {
                    data[to][c] = data[start][c - cost] + tim;
                }
            } else {
                if (data[start][c - cost] != -1) {
                    chmin(data[to][c], data[start][c - cost] + tim);
                }
            }
        }
        dfs(to);
    }
}

int main()
{
    cin >> N >> C >> V;
    rep(i, V)
    {
        cin >> S[i];
    }
    rep(i, V)
    {
        cin >> T[i];
    }
    rep(i, V)
    {
        cin >> Y[i];
    }
    rep(i, V)
    {
        cin >> M[i];
    }
    rep(i, V)
    {
        edges[T[i]].pb(edge{S[i], Y[i], M[i]});
    }
    rep(i, N)
    {
        rep(j, C + 1)
        {
            data[i][j] = -1;
        }
    }
    rep(j, C + 1)
    {
        data[N][j] = 0;
    }

    dfs(N);
    if (data[1][C] == -1) {
        cout << -1 << endl;
    } else {
        cout << data[1][C] << endl;
    }

    return 0;
}