#include<iostream>
#include<vector>
#include<queue>

using namespace std;

#define NMAX 50
#define CMAX 300
#define VMAX 1500
#define INF 100000

typedef struct{
	int T,Y,M;
} edS;

int main(){

	int N,C,V,S[VMAX],T[VMAX],Y[VMAX],M[VMAX];
	vector<edS> edge[NMAX+1];
	int dp[CMAX+1][NMAX+1];
	queue<int> q;

	cin>>N>>C>>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<V;i++){
		edS tmp;
		tmp.T=T[i];
		tmp.Y=Y[i];
		tmp.M=M[i];
		edge[S[i]].push_back(tmp);
	}

	for(int i=0;i<=C;i++){
		for(int j=1;j<=N;j++){
			dp[i][j]=INF;
		}
	}
	dp[C][1]=0;

	q.push(1);

	while(!q.empty()){
		int n=q.front();
		//cout<<n<<endl;
		q.pop();
		for(int i=0;i<edge[n].size();i++){
			for(int j=edge[n][i].Y;j<=C;j++){
				if(dp[j][n]!=INF){
					int to=edge[n][i].T;
					int tc=j-edge[n][i].Y;
					int tm=dp[j][n]+edge[n][i].M;
					//cout<<to<<","<<tc<<","<<tm<<","<<dp[tc][to]<<endl;
					if(dp[tc][to]>tm){
						dp[tc][to]=tm;
						q.push(to);
					}
				}
			}
		}
	}

	int ans=INF;
	for(int i=0;i<=C;i++){
		if(dp[i][N]<ans) ans=dp[i][N];
	}
	if(ans!=INF) cout<<ans<<endl;
	else cout<<"-1"<<endl;
}