#define _CRT_SECURE_NO_WARNINGS
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#include <stack>
#include <array>
#include <fstream>
#include <deque>
#include <bitset>


#define REP(i,n) for(int (i) = 0;(i) < (n) ; ++(i))
#define REPS(a,i,n) for(int (i) = (a) ; (i) < (n) ; ++(i))
#if defined(_MSC_VER)||__cplusplus > 199711L
#define AUTO(r,v) auto r = (v)
#else
#define AUTO(r,v) typeof(v) r = (v)
#endif
#define ALL(c) (c).begin() , (c).end()
#define EACH(it,c) for(AUTO(it,(c).begin());it != (c).end();++it)
#define LL long long
#define int LL
#define INF  99999999
#define DIV 1000000007
#define QUICK_CIN ios::sync_with_stdio(false); cin.tie(0);
#define InitArr1(c,n) memset(&c[0],0,sizeof(int)*n)
#define InitArr2(c,n) memset(&c[0][0],0,sizeof(int)*n)

template<class T>
bool valid(T x, T w){ return 0 <= x&&x < w; }

int di[4] = { 1, -1, 0, 0 };
int dj[4] = { 0, 0, 1, -1 };

using namespace std;

//-----------------------------------------------------------------------------------------------
//-----------------------------------------------------------------------------------------------
//-----------------------------------------------------------------------------------------------

struct N {
	int to, y, m;
};

int n, c, v;

int dp[55][300 * 55];

signed main()
{
	QUICK_CIN;
	//fstream cin("debug.txt");
	//ofstream cout("result.txt");

	while (cin >> n >> c >> v) {
		int s[1600], t[1600], y[1600], m[1600];

		vector<vector<N>> g(55);

		InitArr2(dp, 55 * 300 * 55);

		REP(i, n - 1) {
			REP(j, 300 * 55) {
				dp[i+1][j] = INF;
			}
		}

		REP(i, v) {
			cin >> s[i];
			s[i]--;
		}

		REP(i, v) {
			cin >> t[i];
			t[i]--;
		}

		REP(i, v) {
			cin >> y[i];
		}

		REP(i, v) {
			cin >> m[i];
		}

		REP(i, v) {
			g[s[i]].emplace_back(N{t[i],y[i],m[i]});
		}

		REP(i, n) {
			REP(j, c + 1) {
				for (auto x : g[i]) {
					if(dp[i][j] != INF)
						dp[x.to][j + x.y] = min(dp[x.to][j + x.y], dp[i][j] + x.m);
				}
			}
		}
		
		if (dp[n - 1][c] != INF) {
			cout << dp[n - 1][c] << endl;
			continue;
		}

		cout << -1 << endl;
	}
}