#include <bits/stdc++.h>
using namespace std;
const int N=50+10,C=300+10,M=1500+10;
inline void cmin(int &x,int y) { if (x>y) x=y; }
struct L {
	int s,t,c,m;
	bool operator < (const L& a) const {
		return t<a.t;
	}
} l[M];
int n,v,k,s[M],t[M],c[M],m[M],dp[N][C],ans=0x3f3f3f3f;
int main() {
	scanf("%d%d%d",&n,&v,&k);
	// for (int i=1;i<=k;++i)
	// 	scanf("%d%d%d%d",&l[i].s,&l[i].t,&l[i].c,&l[i].m);
	for (int i=1;i<=k;++i) scanf("%d",&l[i].s);
	for (int i=1;i<=k;++i) scanf("%d",&l[i].t);
	for (int i=1;i<=k;++i) scanf("%d",&l[i].c);
	for (int i=1;i<=k;++i) scanf("%d",&l[i].m);
	sort(l+1,l+k+1);
	memset(dp,0x3f,sizeof(dp));
	memset(dp[1],0,sizeof(dp[1]));
	for (int i=1,x=1;i<=n;++i) {
		while (x<=k&&l[x].t==i) {
			for (int j=l[x].c;j<=v;++j)
				cmin(dp[i][j],dp[l[x].s][j-l[x].c]+l[x].m);
			++x;
		}
		for (int j=1;j<=v;++j)
			cmin(dp[i][j],dp[i][j-1]);
	}
	for (int i=1;i<=v;++i) cmin(ans,dp[n][i]);
	if (ans==0x3f3f3f3f) ans=-1;
	printf("%d\n",ans);
	return 0;
}