#include <cstdio>
#include <algorithm>
using namespace std;

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n):i({0}),n({n}){}range(int i,int n):i({i}),n({n}){}I& begin(){return i;}I& end(){return n;}};

const int inf = 19921223;
int dp[55][333];
int route[55];
int yen[55][1555], mIn[55][1555], graph[55][1555];

int main(void) {
  int n, c, v; scanf("%d%d%d", &n, &c, &v);
  vector<int> s(v), t(v), y(v), m(v);
  for(int i : range(v)) { scanf("%d", &s[i]); }
  for(int i : range(v)) { scanf("%d", &t[i]); }
  for(int i : range(v)) { scanf("%d", &y[i]); }
  for(int i : range(v)) { scanf("%d", &m[i]); }
  for(int i : range(v)) {
    s[i]--; t[i]--;
    graph[s[i]][route[s[i]]] = t[i];
    yen  [s[i]][route[s[i]]] = y[i];
    mIn  [s[i]][route[s[i]]] = m[i];
    route[s[i]]++;
  }
  for(int i : range(n+1)) {
    for(int j : range(c+1)) {
      dp[i][j] = i==0? 0 : inf;
    }
  }
  for(int i : range(n)) {
    for(int k : range(c+1)) {
      if(dp[i][k] == inf) { continue; }
      for(int j : range(route[i])) {
        int kk = k + yen[i][j]; 
        if(kk > c) { continue; }
        dp[graph[i][j]][kk] = min(dp[graph[i][j]][kk], dp[i][k] + mIn[i][j]);
      }
    }
  }
  int res = dp[n-1][c];
  if(res == inf) { res = -1; }
  printf("%d\n", res);
  return 0;
}