#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <complex>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#include <assert.h>
#include <array>
#include <cstdio>
#include <cstring>
#include <random>
#include <functional>
#include <numeric>
#include <bitset>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define minimize(a, x) a = std::min(a, x)
#define maximize(a, x) a = std::max(a, x)

using ll  = long long;
ll const inf = 1LL<<50;

int main() {

  int N, C, V; cin >> N >> C >> V;
  int S[V], T[V], Y[V], M[V];
  rep(i, V) cin >> S[i];
  rep(i, V) cin >> T[i];
  rep(i, V) cin >> Y[i];
  rep(i, V) cin >> M[i];
  int p[V]; rep(i, V) p[i] = i;
  sort(p, p+V, [&](int a, int b){ return S[a] < S[b]; });
  assert(S[p[0]] == 1);

  ll dp[55][333]; rep(i, 55) rep(j, 333) dp[i][j] = inf;
  dp[1][C] = 0;

  rep(i, V) REP(j, Y[p[i]], C+1) {
    minimize(dp[T[p[i]]][j-Y[p[i]]], dp[S[p[i]]][j] + M[p[i]]);
  }

  ll r = *min_element(dp[N], dp[N]+333);
  if(r == inf) { cout << -1 << endl; }
  else { cout << r << endl; }

  return 0;
}