#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>

using namespace std;

struct TOWN{
    vector<int> T,Y,M;
    int way;
    TOWN(){
        way=0;
    }
} town[51];

int main(){
    int N,C,V,info[1500][4],nextcost,nextm,nexttown;
    priority_queue<pair<int,pair<int,int>>> pq;
    pair<int,pair<int,int>> now;
    
    scanf("%d%d%d",&N,&C,&V);
    
    for(int i=0;i<4;i++)
        for(int j=0;j<V;j++)
            scanf("%d",&info[j][i]);
    
    for(int i=0;i<V;i++){
        town[info[i][0]].T.push_back(info[i][1]);
        town[info[i][0]].Y.push_back(info[i][2]);
        town[info[i][0]].M.push_back(-1*info[i][3]);
        town[info[i][0]].way++;
    }
    
    pq.push(make_pair(0,make_pair(0,1)));
    
    while(!pq.empty()){
        now = pq.top();
        pq.pop();
        
        if(now.second.second==N){
            printf("%d",-1*now.first);
            return 0;
        }
        
        for(int i=0;i<town[now.second.second].way;i++){
            nextm = town[now.second.second].M[i]+now.first;
            nextcost = town[now.second.second].Y[i]+now.second.first;
            nexttown = town[now.second.second].T[i];
            if(nextcost<=C)
                pq.push(make_pair(nextm,make_pair(nextcost,nexttown)));
        }
    }
    
    puts("-1");
    return 0;
}