GRL6B.test.cpp

#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/library/5/GRL/6/GRL_6_B"
#include "../memo/macro.hpp"
#include "../graph/min_cost_flow_dijkstra.cpp"

signed main(void) {
    ll n, m, f;
    cin >> n >> m >> f;
    min_cost_max_flow mcf(n);
    REP(i, m) {
        ll u, v, c, d;
        cin >> u >> v >> c >> d;
        mcf.add_edge(u, v, c, d);
    }
    cout << mcf.flow(0, n-1, f) << endl;

    return 0;
}