#include <bits/stdc++.h>
#define ALL(c) c.begin(), c.end()
#define REP(i, n) \
  for (int i = 0; i < (int)(n); ++i)
#define FOR(i, l, r) \
  for (int i = (int)(l); i < (int)(r); ++i)
#define EACH(it, o) \
  for (auto it = (o).begin(); it != (o).end(); ++it)

#define INF (1 << 26)
using namespace std;

int main() {
  int N, C, V;

  scanf("%d", &N);
  scanf("%d", &C);
  scanf("%d", &V);
  int S[V], T[V], Y[V], M[V];
  REP(i, V) {
    scanf("%d", &S[i]);
  }

  REP(i, V) {
    scanf("%d", &T[i]);
  }

  REP(i, V) {
    scanf("%d", &Y[i]);
  }

  REP(i, V) {
    scanf("%d", &M[i]);
  }

  int p[V];
  REP(i, V) {
    p[i] = i;
  }
  sort(p, p + V, [&](int a, int b) {
    return S[a] < S[b];
  });

  long dp[N + 1][C + 1];

  REP(i, N + 1) {
    REP(j, C + 1) {
      dp[i][j] = INF;
    }
  }
  dp[1][C] = 0;

  REP(i, V) {
    int ptr = p[i];

    REP(j, C+1) {
      if (Y[ptr] + j <= C) {
        dp[T[ptr]][j] = min(dp[T[ptr]][j], dp[S[ptr]][j + Y[ptr]] + M[ptr]);
      }
    }
  }

  long min_time = INF;

  REP(i, C+1) {
    min_time = min(min_time, dp[N][i]);
  }

  if (min_time == INF) {
    printf("-1\n");
  } else {
    printf("%ld\n", min_time);
  }
  return 0;
}