#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int n, c, v;
	cin >> n >> c >> v;
	vector<int>s(v), t(v), cost(v), time(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 >> cost[i];
	for (int i = 0; i < v; i++)cin >> time[i];
	vector <vector<pair<int, pair<int, int>>>>edge(n + 1);
	for (int i = 0; i < v; i++) {
		edge[s[i]].push_back({t[i], {cost[i], time[i]}});
	}
	vector<vector<int>>dp(n + 1, vector<int>(c + 1));
	for (int i = 0; i <= n; i++) {
		for (int j = 0; j <= c; j++) {
			dp[i][j] = 1e9;
		}
	}
	dp[1][c] = 0;
	for (int i = 1; i <= n; i++) {
		for (int j = c; j >= 0; j--) {
			if (dp[i][j] != (1e9)) {
				for (auto k : edge[i]) {
					if (j - k.second.first >= 0) {
						dp[k.first][j - k.second.first] = min(dp[k.first][j - k.second.first], dp[i][j] + k.second.second);
					}
				}
			}
		}
	}
	int ans = 1e9;
	for (int i = 0; i <= c; i++) {
		ans = min(ans, dp[n][i]);
	}
	if (ans == 1e9)ans = -1;
	cout << ans << endl;
}