import java.util.ArrayList;
import java.util.Arrays;
import java.util.Random;
import java.util.Scanner;

public class Yuki001 {
    private static boolean isDebug = false;

    public static void main(String[] args) {


        ArrayList<Integer> si = new ArrayList<Integer>();
        ArrayList<Integer> ti = new ArrayList<Integer>();
        ArrayList<Integer> ci = new ArrayList<Integer>();
        ArrayList<Integer> tis = new ArrayList<Integer>();

        Scanner scanner = new Scanner(System.in);

        int N = 10;
        int C = 20;

        if (isDebug) {
        } else {
            N = scanner.nextInt();
            C = scanner.nextInt();
        }

        int[][] cost = new int[N + 1][N + 1];
        int[][] time = new int[N + 1][N + 1];


        if (isDebug) {

            Random random = new Random();
            random.setSeed(1);

            for (int i = 2; i < N + 1; i++) {
                for (int j = 1; j < i; j++) {
                    int k = random.nextInt(C);
                    if (k > 5) {
                        cost[i][j] = k;
                        time[i][j] = random.nextInt(10) + 1;
                        ti.add(i);
                        si.add(j);
                        ci.add(k);
                        tis.add(time[i][j]);
                    }
                }
            }
        } else {
            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++) {
                ci.add(scanner.nextInt());
                cost[ti.get(i)][si.get(i)] = ci.get(i);
            }
            for (int i = 0; i < V; i++) {
                tis.add(scanner.nextInt());
                time[ti.get(i)][si.get(i)] = tis.get(i);
            }
        }

        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]);
                }
            }
        }

        boolean isCheck = false;
        for (int i = C; i >= 0; i--) {
            if (dp[N][i] != MAX) {
                System.out.println(dp[N][i]);
                isCheck = true;
                break;
            }
        }
        if (!isCheck) {
            System.out.println(-1);
        }

        System.out.flush();
        if (isDebug) {
            System.err.println(N);
            System.err.println(C);

            System.err.println(si.size());
            System.err.println(wrap(si));
            System.err.println(wrap(ti));
            System.err.println(wrap(ci));
            System.err.println(wrap(tis));
        }
    }

    static String wrap(ArrayList<? extends Object> list) {
        return list.toString().replace("[", "").replace("]", "").replace(",", "");
    }
}