/*
* 001_sample.cpp
* 
* No.1 道のショートカット
* 難易度3 未完成
*/

#include <iostream>
#include <vector>

using VEC = std::vector<int>;
static const int INF = 1e9+7;

template <class A>
bool setMin(A& left, A const & right) {
	if (left < right) {
		return false;
	}
	left = right;
	return true;
}

int main () {
	int N = 0;
	int C = 0;
	int V = 0;
	std::cin >> N >> C >> V;
	VEC S(V);
	VEC T(V);
	VEC Y(V);
	VEC M(V);
	for (int i = 0; i < V; i++) {
		std::cin >> S[i];
	}
	for (int i = 0; i < V; i++) {
		std::cin >> T[i];
	}
	for (int i = 0; i < V; i++) {
		std::cin >> Y[i];
	}
	for (int i = 0; i < V; i++) {
		std::cin >> M[i];
	}
	
	int dp[N][C+1];
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < C+1; j++) {
			dp[i][j] = INF;
		}
	}

	dp[0][0] = 0;
	
	for (int i = 0; i < N; i++) {
		for (int j = C; j >= 0; j--) {
			if (dp[i][j] != INF) {
			for (int k = 0; k < V; k++) {
				if (i+1 == S[k] && j + Y[k] <= C) {
					//std::cout << "t:" << T[k] - 1 << " y:" << j + Y[k] << " value:" << dp[T[k] - 1][j + Y[k]] << std::endl;
					setMin(dp[T[k] - 1][j + Y[k]], dp[i][j] + M[k]);
					//if (dp[T[k] - 1][j + Y[k]] != INF) {
					//	std::cout << "t:" << T[k] - 1 << " y:" << j + Y[k] << " value:" << dp[T[k] - 1][j + Y[k]] << std::endl;
					//}
				}
			}
			}
		}
	}
	
	int ans = INF;
	for (int i = 0; i < C+1; i++) {
		setMin(ans, dp[N-1][i]);
	}
	std::cout << (ans == INF ? -1 : ans) << std::endl;

	return 0;
	
}