import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


struct MinCut {
  int n;
  long[][] adj;
  this(int n_) {
    n = n_;
    adj = new long[][](n, n);
  }
  void ae(int u, int v, long c) {
    adj[u][v] += c;
    adj[v][u] += c;
  }
  long solve() {
    long ret = long.max;
    auto p = iota(n).array;
    auto b = new long[n];
    for (; --n; ) {
      foreach (u; 0 .. n + 1) b[p[u]] = 0;
      foreach (u; 0 .. n) {
        int vm = u + 1;
        foreach (v; u + 1 .. n + 1) {
          b[p[v]] += adj[p[u]][p[v]];
          if (b[p[vm]] < b[p[v]]) vm = v;
        }
        swap(p[u + 1], p[vm]);
      }
      chmin(ret, b[p[n]]);
      foreach (u; 0 .. n - 1) {
        adj[p[u]][p[n - 1]] += adj[p[u]][p[n]];
        adj[p[n - 1]][p[u]] += adj[p[n]][p[u]];
      }
    }
    return ret;
  }
};


void main() {
  try {
    for (; ; ) {
      const N = readInt();
      const M = readInt();
      const K = readLong();
      auto A = new int[M];
      auto B = new int[M];
      auto C = new long[M];
      auto D = new long[M];
      foreach (i; 0 .. M) {
        A[i] = readInt() - 1;
        B[i] = readInt() - 1;
        C[i] = readLong();
        D[i] = readLong();
      }
      
      auto mc = new MinCut(N);
      foreach (i; 0 .. M) {
        mc.ae(A[i], B[i], D[i]);
      }
      const res = mc.solve;
      debug {
        writeln("res = ", res);
      }
      
      long ans;
      if (res < K) {
        ans = -1;
      } else {
        import core.stdc.stdlib;
        exit(1);
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}