import java.util.*;

public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int C = sc.nextInt();
    int V = sc.nextInt();
    int[] s = new int[V];
    int[] t = new int[V];
    int[] y = new int[V];
    int[] m = new int[V];
    int[][] cost = new int[N][N];
    int[][] time = new int[N][N];
    for(int i = 0; i < V; i++) {
      s[i] = sc.nextInt() - 1;
    }
    for(int i = 0; i < V; i++) {
      t[i] = sc.nextInt() - 1;
    }
    for(int i = 0; i < V; i++) {
      y[i] = sc.nextInt();
    }
    for(int i = 0; i < V; i++) {
      m[i] = sc.nextInt();
    }
    for(int i = 0; i < V; i++) {
      cost[s[i]][t[i]] = y[i];
      time[s[i]][t[i]] = m[i];
    }
    // dp[i][j]はコストj以下で頂点iに行く際の最小時間を表す(不可能なら-1とする)
    int[][] dp = new int[N][C + 1];
    for(int i = 1; i < N; i++) {
      dp[i][0] = -1;
    }
    for(int j = 1; j < C + 1; j++) {
      for(int i = 1; i < N; i++) {
        int min = -1;
        for(int k = 0; k < i; k++) {
          if((cost[k][i] != 0) && (j - cost[k][i] >= 0) && (dp[k][j - cost[k][i]] != -1)) {
            if(min == -1) {
              min = dp[k][j - cost[k][i]] + time[k][i];
            } else {
              min = Math.min(min, dp[k][j - cost[k][i]] + time[k][i]);
            }
          }
        }
        if(min == -1) {
          dp[i][j] = -1;
        } else {
          if(dp[i][j - 1] == -1) {
            dp[i][j] = min;
          } else {
            dp[i][j] = Math.min(min, dp[i][j - 1]);
          }
        }
      }
    }
    System.out.println(dp[N - 1][C]);
  }
}