#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <numeric>
#include <cctype>
#include <tuple>
#include <climits>
#include <bitset>
#include <cassert>
#include <random>

#ifdef _MSC_VER
#include <agents.h>
#endif

#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define REV(v) v.rbegin(), v.rend()
#define MEMSET(v, s) memset(v, s, sizeof(v))
#define UNIQUE(v) (v).erase(unique(ALL(v)), (v).end())
#define MP make_pair
#define MT make_tuple

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

int dp[55][610];

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);

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

	vector<int> s(v), t(v), y(v), m(v);
	rep(i, v) cin >> s[i];
	rep(i, v) cin >> t[i];
	rep(i, v) cin >> y[i];
	rep(i, v) cin >> m[i];

	vector<vector<tuple<int, int, int>>> G(n);
	rep(i, v) G[s[i] - 1].push_back(MT(t[i] - 1, y[i], m[i]));

	rep(i, 55) rep(j, 610) dp[i][j] = 1e9;
	dp[0][0] = 0;
	rep(i, n) rep(j, c + 1){
		if (dp[i][j] == 1e9) continue;
		for (auto t : G[i]){
			int to, cost, dist;
			tie(to, cost, dist) = t;
			dp[to][j + cost] = min(dp[to][j + cost], dp[i][j] + dist);
		}
	}
	int ans = *min_element(dp[n - 1], dp[n - 1] + c + 1);
	cout << (ans != 1e9 ? ans : -1) << endl;

	return 0;
}