import java.util.Scanner;

public class Main {

	static int[] S;
	static int[] T;
	static int[] Y;
	static int[] M;
	static int[][] dp;
	static final int INF = Integer.MAX_VALUE/2;

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int N = sc.nextInt();
		int C = sc.nextInt();
		int V = sc.nextInt();
		dp = new int[N][C+1];
		S = new int[V];
		for (int i=0; i<V; i++) {
			S[i] = sc.nextInt()-1;
		}
		T = new int[V];
		for (int i=0; i<V; i++) {
			T[i] = sc.nextInt()-1;
		}
		Y = new int[V];
		for (int i=0; i<V; i++) {
			Y[i] = sc.nextInt();
		}
		M = new int[V];
		for (int i=0; i<V; i++) {
			M[i] = sc.nextInt();
		}

		for (int i=0; i<N; i++) {
			for (int j=0; j<=C; j++) {
				dp[i][j] = INF;
			}
		}
		for (int i=0; i<=C; i++) {
			dp[0][i] = 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) {
						if (j+Y[k]<=C) {
							dp[T[k]][j+Y[k]] = Math.min(dp[T[k]][j+Y[k]], dp[i][j]+M[k]);
						}
					}
				}
			}
		}

		int ans = dp[N-1][C];
		if (ans == INF) {
			System.out.println(-1);
		} else {
			System.out.println(ans);
		}

		sc.close();
	}
}