// Standard I/O #include #include #include // Standard Library #include #include #include #include // Template Class #include #include #include #include #include #include #include #include // Container Control #include #include using namespace std; #define rep( i, n ) for( int i = 0; i < n; ++i ) #define irep( i, n ) for( int i = n-1; i >= 0; --i ) #define reep( i, s, n ) for ( int i = s; i < n; ++i ) #define ireep( i, n, s ) for ( int i = n-1; i >= s; --i ) #define foreach(itr, x) for( typeof(x.begin()) itr = x.begin(); itr != x.end(); ++itr) #define mp( a, b ) make_pair( a, b ) #define pb( a ) push_back( a ) #define all( v ) v.begin(), v.end() #define fs first #define sc second #define vc vector // for visualizer.html double SCALE = 1.0; double OFFSET_X = 0.0; double OFFSET_Y = 0.0; #define LINE(x,y,a,b) cerr << "line(" << SCALE*(x) + OFFSET_X << "," \ << SCALE*(y) + OFFSET_Y << "," \ << SCALE*(a) + OFFSET_X << "," \ << SCALE*(b) + OFFSET_Y << ")" << endl; #define CIRCLE(x,y,r) cerr << "circle(" << SCALE*(x) + OFFSET_X << "," \ << SCALE*(y) + OFFSET_Y << "," \ << SCALE*(r) << ")" << endl; typedef long long ll; typedef complex Point; typedef pair pii; typedef pair ipii; typedef vector vi; typedef vector vd; typedef vector< vector > vii; typedef vector< vector > vdd; typedef vector::iterator vi_itr; const int IINF = 1 << 28; const double INF = 1e30; const double EPS = 1e-10; const double PI = acos(-1.0); // Direction : L U R D const int dx[] = { -1, 0, 1, 0}; const int dy[] = { 0, -1, 0, 1 }; struct Edge { int t, y, m; Edge(){} Edge( int t, int y, int m ) :t(t), y(y), m(m) {} }; struct Node { int p, c, y; Node(){} Node( int p, int c, int y ) :p(p), c(c), y(y) {} }; inline bool operator < ( const Node& n1, const Node& n2 ) { return (n1.y == n2.y ? n1.c > n2.c : n1.y > n2.y); } int main() { int N, C, V; vector edge[50]; int S[1500], T[1500], Y[1500], M[1500]; cin >> N >> C >> V; rep(i, V){ cin >> S[i]; --S[i]; } rep(i, V){ cin >> T[i]; --T[i]; } rep(i, V){ cin >> Y[i]; } rep(i, V){ cin >> M[i]; } rep(i, V){ edge[S[i]].pb( Edge(T[i], Y[i], M[i]) ); } priority_queue que; que.push( Node(0, 0, 0) ); int ans = -1, d[50], c[50]; bool used[50] = { false }; rep(i, N) d[i] = c[i] = IINF; while( !que.empty() ){ Node n = que.top(); que.pop(); if( used[n.p] ) continue; used[n.p] = true; d[n.p] = n.y; c[n.p] = n.c; rep(i, edge[n.p].size()){ if( n.c + edge[n.p][i].y > C ) continue; if( n.y + edge[n.p][i].m > d[edge[n.p][i].t] ) continue; if( n.y + edge[n.p][i].m == d[edge[n.p][i].t] && n.c + edge[n.p][i].y > c[edge[n.p][i].t] ) continue; que.push( Node(edge[n.p][i].t, n.c + edge[n.p][i].y, n.y + edge[n.p][i].m ) ); } } cout << (d[N-1] == IINF ? -1 : d[N-1]) << endl; }