#include <bits/stdc++.h>
using namespace std;

int main() {
  int n, c, v;
  cin >> n >> c >> v;
  
  vector<int> s(v), t(v), y(v), m(v);
  for (int i = 0; i < v; i++) {
    cin >> s.at(i);
    s.at(i)--;
  }
  for (int i = 0; i < v; i++) {
    cin >> t.at(i);
    t.at(i)--;
  }
  for (int i = 0; i < v; i++) cin >> y.at(i);
  for (int i = 0; i < v; i++) cin >> m.at(i);
  
  vector<vector<int>> x(v, vector<int>(4));
  for (int i = 0; i < v; i++) {
    x.at(i).at(0) = s.at(i);
    x.at(i).at(1) = t.at(i);
    x.at(i).at(2) = y.at(i);
    x.at(i).at(3) = m.at(i);
  }
  
  sort(x.begin(), x.end());
  
  vector<vector<int>> dp(n, vector<int>(c + 1, 1e9));
  dp[0][c] = 0;
  for (int i = 0; i < v; i++) {
    for (int j = c; j >= 0; j--) {
      if (j < x.at(i).at(2)) break;
      dp[x.at(i).at(1)][j - x.at(i).at(2)] = min(dp[x.at(i).at(1)][j - x.at(i).at(2)], dp[x.at(i).at(0)][j] + x.at(i).at(3));
    }
  }
  
  int ans = 1e9;
  for (int j = 0; j <= c; j++) ans = min(ans, dp[n - 1][j]);
  
  if (ans == 1e9) cout << -1 << '\n';
  else cout << ans << '\n';
}