#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
typedef long long ll;
const int inf = 1e9;
int N,C,V;
int S[2000],T[2000],Y[2000],M[2000];
int dp[60][301];
int main()
{
  cin >> N >> C >> V;
  FOR(i,0,V) cin >> S[i];
  FOR(i,0,V) cin >> T[i];
  FOR(i,0,V) cin >> Y[i];
  FOR(i,0,V) cin >> M[i];
  FOR(i,0,60) FOR(j,0,301) dp[i][j] = inf;
  dp[1][0] = 0;
  FOR(i,0,51) {
    FOR(j,0,V) {
      FOR(k,Y[j],301) {
        dp[T[j]][k] = min(dp[T[j]][k], dp[S[j]][k-Y[j]] + M[j]);
      }
    }
  }
  int mn = inf;
  FOR(i,1,C+1) {
    mn = min(mn, dp[N][i]);
  }
  cout << (mn == inf ? -1 : mn) << endl;
  return 0;
}