import java.util.ArrayList; import java.util.Arrays; import java.util.Random; import java.util.Scanner; public class Yuki001 { public static void main(String[] args) { ArrayList si = new ArrayList(); ArrayList ti = new ArrayList(); ArrayList ci = new ArrayList(); ArrayList tis = new ArrayList(); Scanner scanner = new Scanner(System.in); int N; int C; N = scanner.nextInt(); C = scanner.nextInt(); int[][] cost = new int[N + 1][N + 1]; int[][] time = new int[N + 1][N + 1]; int V = scanner.nextInt(); for (int i = 0; i < V; i++) { si.add(scanner.nextInt()); } for (int i = 0; i < V; i++) { ti.add(scanner.nextInt()); } for (int i = 0; i < V; i++) { cost[ti.get(i)][si.get(i)] = scanner.nextInt(); } for (int i = 0; i < V; i++) { time[ti.get(i)][si.get(i)] = scanner.nextInt(); } int MAX = Integer.MAX_VALUE / 2; int[][] dp = new int[N + 1][C + 1]; for (int i = 0; i < dp.length; i++) { Arrays.fill(dp[i], MAX); } dp[1][C] = 0; for (int i = 2; i < N + 1; i++) { for (int k = 1; k < i; k++) { if (cost[i][k] == 0) { break; } for (int t = 0; t <= C; t++) { if (dp[k][t] >= MAX) { continue; } int c = t - cost[i][k]; if (c < 0) { continue; } dp[i][c] = Math.min(dp[i][c], dp[k][t] + time[i][k]); } } } int min = Integer.MAX_VALUE; for (int i = C; i >= 0; i--) { if (dp[N][i] != MAX) { min = Math.min(min, dp[N][i]); } } if (min == Integer.MAX_VALUE) { System.out.println(-1); } else { System.out.println(min); } } static String wrap(ArrayList list) { return list.toString().replace("[", "").replace("]", "").replace(",", ""); } }