#include<iostream>
#include<vector>
#include<string>
#include<algorithm>	
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mt make_tuple
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef tuple<int,int,int> tp;
typedef vector<tp> vt;
typedef vector<vd> vvd;
typedef pair<int,pii> pip;
typedef vector<pip>vip;
const double PI=acos(-1);
const double EPS=1e-7;
const int inf=1e8;
const ll INF=1e16;
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
int main(){
	int n,c;
	cin>>n>>c;
	vector<vt>G(n);
	int m;
	cin>>m;
	vvi in(4,vi(m));
	rep(i,4)rep(j,m)cin>>in[i][j];
	rep(i,m)G[in[0][i]-1].pb(mt(in[1][i]-1,in[2][i],in[3][i]));
	vvi dp(n+1,vi(c+1,inf));
	dp[0][c]=0;
	queue<tp>que;
	que.push(mt(0,c,0));
	while(!que.empty()){
		int a,b,c;
		tie(a,b,c)=que.front();
		que.pop();
		if(dp[a][b]<c)continue;
		rep(i,G[a].size()){
			int A,B,C;
			tie(A,B,C)=G[a][i];
			int to=A;
			int nb=b-B;
			int nc=c+C;
			if(nb<0)continue;
			if(dp[to][nb]>nc){
				dp[to][nb]=nc;
				que.push(mt(to,nb,nc));
			}
		}
	}
	int out=inf;
	rep(i,c+1)out=min(out,dp[n-1][i]);
	if(out==inf)out=-1;
	cout<<out<<endl;
}