import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.Deque;
import java.util.HashMap;
import java.util.InputMismatchException;
import java.util.Map;
import java.util.PriorityQueue;
import java.math.BigInteger;
    
public class Main{

static final InputStream in=System.in;
static final PrintWriter out=new PrintWriter(System.out);
static final int INF=Integer.MAX_VALUE/2;
static final long LINF=Long.MAX_VALUE/2;
static int N,V,C;
static MyArrayList[] array=new MyArrayList[55];
static int[][] dp=new int[55][305];

public static class Edge{
int to;
int cost;
int time;
public Edge(int to,int cost,int time){
this.to=to; this.cost=cost; this.time=time;
}
}

public static class MyArrayList extends ArrayList<Edge>{}

public static void main(String[] args) throws IOException{
InputReader ir=new InputReader(in);
N=ir.nextInt();
C=ir.nextInt();
V=ir.nextInt();
int[] S=ir.toIntArray(V);
int[] T=ir.toIntArray(V);
int[] Y=ir.toIntArray(V);
int[] M=ir.toIntArray(V);
for(int i=0;i<N;i++) array[i]=new MyArrayList();
for(int i=0;i<V;i++) array[S[i]-1].add(new Edge(T[i]-1,Y[i],M[i]));
for(int i=0;i<N-1;i++) Arrays.fill(dp[i],INF);
for(int i=N-2;i>=0;i--){
for(int j=C;j>=0;j--){
ArrayList<Edge> list=array[i];
for(int k=0;k<list.size();k++){
Edge e=list.get(k);
if(j>=e.cost&&dp[e.to][j-e.cost]!=INF) dp[i][j]=Math.min(dp[i][j],dp[e.to][j-e.cost]+e.time);
}
}
}
out.println(dp[0][C]==INF?-1:dp[0][C]);
out.flush();
}

static class InputReader {
private InputStream in;
private byte[] buffer=new byte[1024];
private int curbuf;
private int lenbuf;

public InputReader(InputStream in) {this.in=in;}
  
public int readByte() {
if(lenbuf==-1) throw new InputMismatchException();
if(curbuf>=lenbuf){
curbuf= 0;
try{
lenbuf=in.read(buffer);
}
catch (IOException e) {
throw new InputMismatchException();
}
if(lenbuf<=0)
return -1;
}
return buffer[curbuf++];
}

public boolean isSpaceChar(int c){return !(c>=33&&c<=126);}

private int skip() {int b; while((b = readByte())!=-1&&isSpaceChar(b)); return b;}

public String next() {
int b=skip();
StringBuilder sb=new StringBuilder();
while(!isSpaceChar(b)){
sb.appendCodePoint(b);
b=readByte();
}
return sb.toString();
}
 
public int nextInt() {
int c=readByte();
while (isSpaceChar(c)) c=readByte();
boolean minus=false;
if (c=='-') {
minus=true;
c=readByte();
}
int res=0;
do{
if(c<'0'||c>'9') throw new InputMismatchException();
res=res*10+c-'0';
c=readByte();
}while(!isSpaceChar(c));
return (minus)?-res:res;
}

public long nextLong() {
int c=readByte();
while (isSpaceChar(c)) c=readByte();
boolean minus=false;
if (c=='-') {
minus=true;
c=readByte();
}
long res = 0;
do{
if(c<'0'||c>'9') throw new InputMismatchException();
res=res*10+c-'0';
c=readByte();
}while(!isSpaceChar(c));
return (minus)?-res:res;
}

public int[] toIntArray(int n){
int[] a=new int[n];
for(int i=0;i<n;i++) a[i]=nextInt();
return a;
}
}
}