#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

const double EPS = 1e-10;
const double PI  = acos(-1.0);
const int MAX = 999999;

#define CLR(a) memset((a), 0 ,sizeof(a))

#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

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

	int N, C, V;
	cin >> N >> C >> V;

	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>>> R(N);
	REP(i, V){
		R[S[i] - 1].push_back(make_tuple(T[i] - 1, Y[i], M[i]));
	}

	vector<vector<int> > dp(N, vector<int>(C + 1, MAX));
	dp[0][C] = 0;

	REP(i, N){
		REP(j, C + 1){
			if(dp[i][j] == MAX) continue;
			for(auto k: R[i]){
				int curT = get<0>(k);
				int curC = j - get<1>(k);
				int curM = dp[i][j] + get<2>(k);
				if(curC >= 0) dp[curT][curC] = min(dp[curT][curC], curM);
			}
		}
	}

	int ret = MAX;
	REP(i, C + 1){
		ret = min(ret, dp[N - 1][i]);
	}
	if(ret == MAX) cout << "-1" << endl;
	else cout << ret << endl;

	return 0;
}