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

#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)

#define ll long long
#define ull unsigned ll

void reader(int *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(int *x, int *y){reader(x);reader(y);}
void reader(int *x, int *y, int *z){reader(x);reader(y);reader(z);}
void reader(ll *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
int reader(char c[]){int i,s=0;for(;;){mygc(i);if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF) break;}c[s++]=i;for(;;){mygc(i);if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF) break;c[s++]=i;}return s;}

void writer(int x, char c){int s=0,m=0;char f[10];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(ll x, char c){int s=0,m=0;char f[20];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(const char c[]){int i;for(i=0;c[i]!='\0';i++)mypc(c[i]);}

#define INF 1000000000

int N, C, V;
int edge[55][1888], dist[55][1888], cost[55][1888], es[55];

int S[10000], T[10000], Y[10000], M[10000];

int dp[55][555];

int main(){
  int i, j, k;
  int res;

  reader(&N,&C,&V);
  assert(1<=N&&N<=50);
  assert(0<=C&&C<=300);
  assert(1<=V&&V<=1500);

  rep(i,N) rep(j,N) dist[i][j] = -1;
  rep(i,V) reader(S+i);
  rep(i,V) reader(T+i);
  rep(i,V) reader(Y+i);
  rep(i,V) reader(M+i);

  rep(i,N) es[i] = 0;
  rep(i,V){
    assert(1 <= S[i] && S[i] < T[i] && T[i] <= N);
    S[i]--, T[i]--;
    edge[S[i]][es[S[i]]] = T[i];
    dist[S[i]][es[S[i]]] = M[i];
    cost[S[i]][es[S[i]]] = Y[i];
    es[S[i]]++;
  }

  rep(i,N) rep(j,C+1) dp[i][j] = INF;
  rep(j,C+1) dp[0][j] = 0;

  rep(i,N) rep(k,C+1) if(dp[i][k] != INF) rep(j,es[i]){
    if(k+cost[i][j] <= C) dp[edge[i][j]][k+cost[i][j]] = min(dp[edge[i][j]][k+cost[i][j]], dp[i][k]+dist[i][j]);
  }

  res = dp[N-1][C];
  if(res==INF) res = -1;
  writer(res,'\n');

  return 0;
}