#include <cstdio>
#include <iostream>
#include <vector>
#include <set>
using namespace std;
#define ITER(c)             __typeof__((c).begin())
#define FOREACH(it, c)      for (ITER(c) it=(c).begin(); it != (c).end(); ++it)
#define REP(i, n)           for(int(i)=0;(i)<(n);++(i))
#define pb push_back
#define mp make_pair

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

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];

    vector<pair<int,pair<int,int> > > v[51];
    set< pair<int,int> > vq[51];
    REP(i,V) v[S[i]-1].pb(mp(T[i]-1,mp(Y[i],M[i])));
    vq[0].insert(mp(0,0));

    REP(i,N){
        int minm = 1<<29;
        FOREACH(it, vq[i]){
            int y = it->first, m = it->second;
            if(minm <= m) continue;
            minm = m;
            //fprintf(stderr, "i = %d, y = %d, m = %d\n", i, y, m);
            FOREACH(jt, v[i]){
                int t = jt->first, ny = y + jt->second.first, nm = m + jt->second.second;
                if(ny <= C){
                    vq[t].insert(mp(ny,nm));
                }
            }
        }
    }
    int minv = 1<<29;
    FOREACH(it, vq[N-1]){
        minv = min(minv, it->second);
    }
    if(minv == 1<<29) minv = -1;
    cout << minv << endl;
    return 0;
}