#include using namespace std; template using min_priority_queue = priority_queue,greater>; template void printv(vector &v){ bool b = false; for(auto i : v){ if(b) cout << " "; else b = true; cout << i; } cout << endl; } int64_t rand64(){ int64_t l = rand(); int64_t r = rand(); return (l<<31)+r; } template bool chmin(T &a, const T& b) { if (a > b) { a = b; // aをbで更新 return true; } return false; } template bool chmax(T &a, const T& b) { if (a < b) { a = b; // aをbで更新 return true; } return false; } bool yn(bool b){ if(b) cout << "Yes" << endl; else cout << "No" << endl; return b; } bool debug; bool randomInput; bool debugOutput; int numOfTestCase; using ans_type = int; void input(){ if(numOfTestCase > 1){ } if(randomInput){ } else{ } return; } void output_input(){ ; } ans_type calc(){ int N, C, V; cin >> N >> C >> V; vector> vinput(4, vector(V)); for(auto &i : vinput){ for(auto &j : i){ cin >> j; } } vector>> G(N*(C+1)); for(int i = 0; i < V; i++){ int s = vinput[0][i]; int t = vinput[1][i]; int y = vinput[2][i]; int m = vinput[3][i]; s--; t--; for(int j = y; j <= C; j++){ G[s*(C+1)+j].push_back({m, t*(C+1)+j-y}); } } int INF = 1001002003; vector D(N*(C+1), INF); D[0*(C+1)+C] = 0; min_priority_queue> q; q.push({0, 0*(C+1)+C}); while(q.size()){ auto [d, i] = q.top(); q.pop(); if(d > D[i]) continue; for(auto[e, j] : G[i]){ if(chmin(D[j], d + e)) q.push({D[j], j}); } } int ans = INF; for(int i = 0; i <= C; i++){ chmin(ans, D[(N-1)*(C+1)+i]); } if(ans == INF) ans = -1; cout << ans << endl; return ans_type(); } ans_type calc_simple(){ return ans_type(); } void output(ans_type ans){ return; } int main(){ debug = 0; randomInput = 0; debugOutput = 0; numOfTestCase = 1; srand(time(NULL)); cout << fixed << setprecision(12); if(numOfTestCase == 0) cin >> numOfTestCase; if(debug){ for(int i = 0; i < numOfTestCase; i++){ if(debugOutput) cout << string(16, '-') << endl; input(); ans_type ans = calc(); ans_type ansSimple = calc_simple(); if(ans != ansSimple){ output_input(); output(ans); output(ansSimple); } } } else{ for(int i = 0; i < numOfTestCase; i++){ input(); output(calc()); } } return 0; }