import java.util.Scanner;
public class Yuki1{
	public static void main(String[] arg){
		Scanner sc = new Scanner(System.in);
		int n,c,v,res = 50000;
		boolean find=false;
		n = sc.nextInt();
		c = sc.nextInt();
		v = sc.nextInt();
		int[] s = new int[v];
		int[] t = new int[v];
		int[] y = new int[v];
		int[] m = new int[v];
		for(int i = 0;i<v;i++){
			s[i] = sc.nextInt();
		}
		for(int i = 0;i<v;i++){
			t[i] = sc.nextInt();
		}
		for(int i = 0;i<v;i++){
			y[i] = sc.nextInt();
		}
		for(int i = 0;i<v;i++){
			m[i] = sc.nextInt();
		}
		int[][] dp = new int[n+1][c+1];
		dp[1][0] = 1;
		for(int i = 0;i<n+1;i++){
			for(int j = 0;j<c+1;j++){
				dp[i][j] = 50000;
			}
		}
		dp[1][0] = 0;
		for(int i = 1;i<n;i++){
			for(int j = 0;j<v;j++){
				for(int k = 0;k<=c-y[j];k++){
					if(dp[i][k] != 50000 && s[j] == i && dp[t[j]][k+y[j]] > dp[i][k] + m[j]){
						dp[t[j]][k+y[j]] = dp[i][k] + m[j];
					}
				}
			}
		}
		for(int i = 0; i<c+1;i++){
			if(dp[n][i] != 0){
				if(res > dp[n][i]){
					res = dp[n][i];
					find = true;
				}
			}
		}
		if(find){
			System.out.println(res);
		}else{
			System.out.println(-1);
		}
	}
}