#include <iostream>
#include <vector>
#include <queue>
#include <climits>
using namespace std;

struct Road {
	int town_num;
	int money;
	int time;
};

struct State {
	int town_num;
	int remaining_money;
	int total_time;
};

int main() {

	int n, c, v;
	cin >> n >> c >> v;

	int data[1500][4];
	for (int y = 0; y < 4; y++) {
		for (int x = 0; x < v; x++) {
			cin >> data[x][y];
		}
	}

	vector<Road> all_roads[51];
	for (int x = 0; x < v; x++) {
		all_roads[data[x][0]].push_back(Road{ data[x][1], data[x][2], data[x][3] });
	}

	pair<int, int> dist[51];
	for (int i = 1; i <= n; i++) {
		dist[i] = make_pair(INT_MAX, INT_MAX);
	}

	queue<State> states;
	states.push(State{ 1, c, 0 });

	while (!states.empty()) {
		State state = states.front(); states.pop();
		vector<Road> roads = all_roads[state.town_num];
		for (int i = 0; i < roads.size(); i++) {
			Road road = roads[i];

			int remaining_money = state.remaining_money - road.money;
			if (remaining_money < 0)
				continue;

			int total_time = state.total_time + road.time;
			pair<int, int> cost = dist[road.town_num];
			if (total_time > cost.first || (total_time == cost.first && remaining_money < cost.second))
				continue;
			dist[road.town_num] = make_pair(total_time, remaining_money);

			states.push(State{ road.town_num, remaining_money, total_time});
		}
	}

	if (dist[n].first == INT_MAX)
		cout << -1 << endl;
	else
		cout << dist[n].first << endl;

	return 0;
}