#include <algorithm>
#include <iostream>

using namespace std;

const int INF = 1000000;

int N, C, V;
int S[1500], T[1500], Y[1500], M[1500];
int dp[50][301];

int main(int argc, char** argv) {
	cin >> N >> C >> V;
	for (int i = 0; i < V; i++) {
		cin >> S[i]; S[i]--;
	}
	for (int i = 0; i < V; i++) {
		cin >> T[i]; T[i]--;
	}
	for (int i = 0; i < V; i++) {
		cin >> Y[i];
	}
	for (int i = 0; i < V; i++) {
		cin >> M[i];
	}
	for (int i = 0; i < N; i++) {
		for (int j = 0; j <= C; j++) {
			dp[i][j] = INF;
		}
	}
	dp[0][C] = 0;
	for (int i = 0; i < N; i++) {
		for (int j = 0; j <= C; j++) {
			for (int k = 0; k < V; k++) {
				if (S[k] == i && Y[k] <= j) {
					dp[T[k]][j - Y[k]] = min(dp[T[k]][j - Y[k]], dp[i][j] + M[k]);
				}
			}
		}
	}
	int res = INF;
	for (int i = 0; i <= C; i++) {
		res = min(res, dp[N - 1][i]);
	}
	res = res == INF ? -1 : res;
	cout << res << endl;
}