#include <bits/stdc++.h>
#define endl codeforces
#define ALL(v) std::begin(v), std::end(v)
#define ALLR(v) std::rbegin(v), std::rend(v)
using ll = std::int64_t;
using ull = std::uint64_t;
using pii = std::pair<int, int>;
using tii = std::tuple<int, int, int>;
using pll = std::pair<ll, ll>;
using tll = std::tuple<ll, ll, ll>;
template <typename T> using vec = std::vector<T>;
template <typename T> using vvec = vec<vec<T>>;
template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T> const T& clamp(const T &t, const T &low, const T &high) { return std::max(low, std::min(high, t)); }
template <typename T> void chclamp(T &t, const T &low, const T &high) { return t = clamp(t, low, high); }
template <typename T> T make_v(T init) { return init; }
template <typename T, typename... Tail> auto make_v(T init, std::size_t s, Tail... tail) { auto v = std::move(make_v(init, tail...)); return vec<decltype(v)>(s, v); }
template <typename T, std::size_t Head, std::size_t ...Tail> struct multi_dem_array { using type = std::array<typename multi_dem_array<T, Tail...>::type, Head>; };
template <typename T, std::size_t Head> struct multi_dem_array<T, Head> { using type = std::array<T, Head>; };
template <typename T, std::size_t ...Args> using mdarray = typename multi_dem_array<T, Args...>::type;
namespace init__ { struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } init_io; }

namespace graph {

using Node = ll;
using Weight = ll;
using Edge = std::pair<Node, Weight>;

template <bool Directed>
struct Graph : public vvec<Edge> {
    using vvec<Edge>::vvec;

    void add_edge(Node f, Node t, Weight w = 1) {
        (*this)[f].emplace_back(t, w);
        if (!Directed) (*this)[t].emplace_back(f, w);
    }

    Graph<Directed> build_inv() const {
        Graph<Directed> ret(this->size());
        for (Node i = 0; i < this->size(); i++) {
            for (const Edge &e : (*this)[i]) {
                Node j;
                Weight w;
                std::tie(j, w) = e;
                if (!Directed && j < i) continue;
                ret.add_edge(j, i, w);
            }
        }

        return ret;
    }
};

}

namespace graph {

using Capacity = ll;

struct FlowEdge : public std::tuple<Node, Capacity, ll, Weight> {
    using std::tuple<Node, Capacity, ll, Weight>::tuple;

    Node& to() {
        return std::get<0>(*this);
    }

    const Node& to() const {
        return std::get<0>(*this);
    }

    Capacity& cap() {
        return std::get<1>(*this);
    }

    const Capacity& cap() const {
        return std::get<1>(*this);
    }

    ll& rev_idx() {
        return std::get<2>(*this);
    }

    const ll& rev_idx() const {
        return std::get<2>(*this);
    }

    Weight& weight() {
        return std::get<3>(*this);
    }

    const Weight& weight() const {
        return std::get<3>(*this);
    }
};

template <bool Directed>
struct FlowGraph : public vvec<FlowEdge> {
    using vvec<FlowEdge>::vvec;

    void add_edge(Node f, Node t, Capacity c = 1, Weight w = 1) {
        add_edge_with_rev(f, t, c, w);
        if (!Directed) add_edge_with_rev(t, f, c, w);
    }

private:
    void add_edge_with_rev(Node f, Node t, Capacity c, Weight w) {
        FlowEdge fe(t, c, (ll)((*this)[t].size()), w);
        (*this)[f].push_back(fe);
        FlowEdge rfe(f, Capacity(), (ll)((*this)[f].size()) - 1, -w);
        (*this)[t].push_back(rfe);
    }
};

}

namespace flow {

using graph::Node;
using graph::Weight;
using graph::Capacity;

template <typename FlowGraph>
class MinCostFlow {
    using prev_node_t = std::pair<Node, ll>;
    using pq_ele_t = std::pair<Weight, Node>;
    FlowGraph fgraph;
    const Capacity cinf;
    const Weight dinf = 5e15;
    vec<Weight> dists, potential;
    vec<prev_node_t> pnode;

    void dijk(Node start) {
        std::priority_queue<pq_ele_t, vec<pq_ele_t>, std::greater<pq_ele_t>> pq;
        std::fill(ALL(dists), dinf);
        dists[start] = 0;
        pq.emplace(0, start);
        while (pq.size()) {
            Weight d;
            Node from;
            std::tie(d, from) = pq.top();
            pq.pop();
            if (dists[from] < d) continue;
            for (ll i = 0; i < fgraph[from].size(); i++) {
                const auto &edge = fgraph[from][i];
                auto to = edge.to();
                Weight dnxt = d + edge.weight() + potential[from] - potential[to];
                if (edge.cap() <= 0 || dists[to] <= dnxt) continue;
                dists[to] = dnxt;
                pnode[to] = prev_node_t(from, i);
                pq.emplace(dnxt, to);
            }
        }
    }

public:

    MinCostFlow(const FlowGraph &fgraph, const Capacity &cinf = 5e15)
        : fgraph(fgraph), cinf(cinf), dists(fgraph.size()), 
          potential(fgraph.size(), 0), pnode(fgraph.size())
    {
    }

    Weight solve(Node start, Node goal, Capacity flow) {
        Weight ret = 0;
        while (0 < flow) {
            dijk(start);
            if (dists[goal] == dinf) return -1;
            for (ll i = 0; i < fgraph.size(); i++) potential[i] += dists[i];

            Capacity max_flow = flow;
            for (Node cur = goal; cur != start; cur = pnode[cur].first) {
                Node pre;
                ll pidx;
                std::tie(pre, pidx) = pnode[cur];
                const auto &edge = fgraph[pre][pidx];
                chmin(max_flow, edge.cap());
            }

            if (max_flow == 0) return -1;
            flow -= max_flow;
            ret += max_flow * potential[goal];
            for (Node cur = goal; cur != start; cur = pnode[cur].first) {
                Node pre;
                ll pidx;
                std::tie(pre, pidx) = pnode[cur];
                auto &edge = fgraph[pre][pidx];
                edge.cap() -= max_flow;
                auto &redge = fgraph[cur][edge.rev_idx()];
                redge.cap() += max_flow;
            }
        }

        return ret;
    }
};

}

// solution for http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_6_B&lang=jp
int main() {
    ll n, e, f;
    std::cin >> n >> e >> f;
    graph::FlowGraph<true> fg(n);
    while (e--) {
        ll a, b, c, d;
        std::cin >> a >> b >> c >> d;
        fg.add_edge(a, b, c, d);
    }

    flow::MinCostFlow<decltype(fg)> mcf(fg);
    std::cout << mcf.solve(0, n - 1, f) << '\n';
    return 0;
}



Measured memory_bytes: 3316