#include <bits/stdc++.h>
#define rep(i, n) for(int i=0;i<(int)(n);++i)
#define rep1(i, n) for(int i=1;i<=(int)(n);++i)
#define irep(i, a, n) for(int i=a;i<(int)(n);++i)
#define rrep(i, n) for(int i=(int)(n)-1;i>=0;--i)
#define rrep1(i, n) for(int i=(int)(n);i>=1;--i)
#define allrep(V, v) for(auto&& V:v)
#define all(x) (x).begin(),(x).end()
typedef long long lint;
const int INF=1<<29;
const double EPS=1e-9;
using namespace std;


int n,c,v;
vector<vector<vector<int>>> cost(51,vector<vector<int>>(51,vector<int>(1,INF)));
vector<vector<vector<int>>> zeit(51,vector<vector<int>>(51,vector<int>(1,INF)));

int solve(int town, int costlimit)
{
  if(costlimit < 0) return INF;
  if(town == 1) return 0;
  int mini=INF;
  rep1(i,town-1){
    rep(j,zeit[town-i][town].size()){
      if(zeit[town-i][town][j]!=INF && (costlimit-cost[town-i][town][j])>=0){
        mini=min(mini,solve(town-i,costlimit-cost[town-i][town][j])+zeit[town-i][town][j]);
      }
    }
  }
  return mini;
}

int main (void)
{
  cin>>n>>c>>v;
  vector<int> s(1501),t(1501),y(1501),m(1501);
  rep1(i,v) cin>>s[i];
  rep1(i,v) cin>>t[i];
  rep1(i,v) cin>>y[i];
  rep1(i,v) cin>>m[i];
  rep1(i,v){
    if(cost[s[i]][t[i]][0] == INF){
      cost[s[i]][t[i]][0]=y[i];
      zeit[s[i]][t[i]][0]=m[i];
    }else{
      cost[s[i]][t[i]].push_back(y[i]);
      zeit[s[i]][t[i]].push_back(m[i]);
    }
  }

  int ans=solve(n,c);
  cout << (ans<INF ? ans : -1) << endl;
  return 0;
}