#include<set>

 #include<cmath>

 #include<queue>

 #include<vector>

 #include<cstdio>

 #include<cstring>

 #include<iostream>

 #include<algorithm>

 #define trav(u,i) for(int i=front[u];i;i=e[i].nxt)

 #define FOR(a,b,c) for(int a=(b);a<=(c);a++)

 using namespace std;

 typedef long long ll;

 const int N = 1e3+;

 const int inf = 2e9;

 ll read() {

     char c=getchar();

     ll f=,x=;

     while(!isdigit(c)) {

         if(c=='-') f=-; c=getchar();

     }

     while(isdigit(c))

         x=x*+c-'',c=getchar();

     return x*f;

 }

 struct Edge {  int u,v,cap,flow,cost,t;

 };

 struct MCMF {

     int n,m,s,t;

     int a[N],inq[N],d[N],p[N];

     queue<int> q;

     vector<Edge> es;

     vector<int> g[N];

     void init(int n) {

         this->n=n;

         es.clear();

         for(int i=;i<=n;i++) g[i].clear();

     }

     void AddEdge(int u,int v,int w,int c,int f) {

         es.push_back((Edge){u,v,w,,f*c,c});

         es.push_back((Edge){v,u,,,-f*c,c});

         int m=es.size();

         g[u].push_back(m-);

         g[v].push_back(m-);

     }

     bool spfa(int s,int t,int& flow,int& cost) {

         memset(inq,,sizeof(inq));

         for(int i=;i<=n;i++) d[i]=inf;

         q.push(s);

         inq[s]=,a[s]=inf,d[s]=;

         while(!q.empty()) {

             int u=q.front(); q.pop();

             inq[u]=;

             for(int i=;i<g[u].size();i++) {

                 Edge& e=es[g[u][i]];

                 int v=e.v;

                 if(e.cap>e.flow && d[v]>d[u]+e.cost) {

                     d[v]=d[u]+e.cost;

                     p[v]=g[u][i];

                     a[v]=min(a[u],e.cap-e.flow);

                     if(!inq[v])

                         inq[v]=,

                         q.push(v);

                 }

             }

         }

         if(d[t]==inf) return ;

         flow+=a[t],cost+=a[t]*d[t];

         for(int x=t;x!=s;x=es[p[x]].u) {

             es[p[x]].flow+=a[t];

             es[p[x]^].flow-=a[t];

         }

         return ;

     }

     void mcmf(int s,int t,int& flow,int& cost) {

         flow=cost=;

         while(spfa(s,t,flow,cost)) ;

     }

 } mc;

 int n,m,K;

 int main()

 {

     n=read(),m=read(),K=read();

     mc.init(n+);

     int S=,T=n;

     int u,v,w,c;

     FOR(i,,m) {

         u=read(),v=read(),w=read(),c=read();

         mc.AddEdge(u,v,w,c,);

     }

     int flow,cost;

     mc.mcmf(,n,flow,cost);

     printf("%d ",flow);

     int mx=mc.es.size();

     for(int i=;i<mx;i+=) {

         Edge e=mc.es[i];

         mc.AddEdge(e.u,e.v,inf,e.t,);

     }

     mc.AddEdge(S,,K,,);

     mc.mcmf(S,T,flow,cost);

     printf("%d",cost);

     return ;

 }