#include <bits/stdc++.h>
#include <iterator>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define debug 1
using ll = long long;
using ld = long double;
const int mod = 998244353;
const double pi = atan2(0, -1);
#include <time.h>
#include <chrono>

int main() {
	int N, C, V;
	cin >> N >> C >> V;
	vector<vector<vector<int>>> path(N);
	vector<vector<int>> memo(V, vector<int>(4));
	rep(i, 4) {
		rep(j, V) {
			cin >> memo[j][i];
		}
	}
	rep(i, V) {
		int s = memo[i][0] - 1;
		int t = memo[i][1] - 1;
		int y = memo[i][2];
		int m = memo[i][3];
		path[s].push_back({ t,y,m });
	}
	

	priority_queue < vector<int>, vector<vector<int>>, greater<vector<int>>> pq;
	vector<int> ans = { (mod,mod) };
	queue<vector<int>> q;
	q.push({ 0, 0, 0 });
	while (!q.empty()) {
		int now = q.front()[0];
		int time = q.front()[1];
		int cost = q.front()[2];
		q.pop();
		for (vector<int> v : path[now]) {
			int x = v[0];
			int nt = time + v[2];
			int nc = cost + v[1];
			if (nc > C) {
				continue;
			}
			if (x == N - 1&&nt<ans[0]) {
				ans = { nt,nc };
			}
			else {
				q.push({ x,nt,nc });
			}
		}
	}

	if (ans[0]==mod) {
		cout << -1 << endl;
	}
	else {
		cout << ans[0] << endl;
	}
}