/**************************************************************

     Problem: 1834

     User: Tunix

     Language: C++

     Result: Accepted

     Time:36 ms

     Memory:3824 kb

 ****************************************************************/

 //BZOJ 1834

 #include<vector>

 #include<cstdio>

 #include<cstring>

 #include<cstdlib>

 #include<iostream>

 #include<algorithm>

 #define rep(i,n) for(int i=0;i<n;++i)

 #define F(i,j,n) for(int i=j;i<=n;++i)

 #define D(i,j,n) for(int i=j;i>=n;--i)

 #define pb push_back

 using namespace std;

 inline int getint(){

     int v=,sign=; char ch=getchar();

     while(ch<''||ch>''){ if (ch=='-') sign=-; ch=getchar();}

     while(ch>=''&&ch<=''){ v=v*+ch-''; ch=getchar();}

     return v*sign;

 }

 const int N=,M=,INF=~0u>>;

 typedef long long LL;

 /******************tamplate*********************/

 int n,m,k,ans;

 struct edge{int from,to,v,c,w;};

 struct Net{

     edge E[M],G[M];

     int head[N],next[M],cnt;

     void ins(int x,int y,int v,int c){

         E[++cnt]=(edge){x,y,v,,c};

         next[cnt]=head[x]; head[x]=cnt;

     }

     void add(int x,int y,int v,int c){

         ins(x,y,v,c); ins(y,x,,-c);

     }

     void Ins(int x,int y,int v,int c){

         E[++cnt]=(edge){x,y,v,c,};

         next[cnt]=head[x]; head[x]=cnt;

     }

     void Add(int x,int y,int v,int c){

         Ins(x,y,v,c); Ins(y,x,,-c);

     }

     int s,t,d[N],Q[M];

     bool mklevel(){

         F(i,,n) d[i]=-;

         d[s]=;

         int l=,r=-;

         Q[++r]=s;

         while(l<=r){

             int x=Q[l++];

             for(int i=head[x];i;i=next[i])

                 if (d[E[i].to]==- && E[i].v){

                     d[E[i].to]=d[x]+;

                     Q[++r]=E[i].to;

                 }

         }

         return d[t]!=-;

     }

     int dfs(int x,int a){

         if (x==t) return a;

         int flow=;

         for(int i=head[x];i && flow<a;i=next[i])

             if (E[i].v && d[E[i].to]==d[x]+){

                 int f=dfs(E[i].to,min(a-flow,E[i].v));

                 E[i].v-=f;

                 E[i^].v+=f;

                 flow+=f;

             }

         if (!flow) d[x]=-;

         return flow;

     }

     void Dinic(){

         while(mklevel()) ans+=dfs(s,INF);

     }

     int from[M];

     bool inq[N];

     bool spfa(){

         int l=,r=-;

         F(i,,n) d[i]=INF;

         d[s]=; Q[++r]=s; inq[s]=;

         while(l<=r){

             int x=Q[l++];

             inq[x]=;

             for(int i=head[x];i;i=next[i])

                 if (E[i].v> && d[x]+E[i].c<d[E[i].to]){

                     d[E[i].to]=d[x]+E[i].c;

                     from[E[i].to]=i;

                     if (!inq[E[i].to]){

                         Q[++r]=E[i].to;

                         inq[E[i].to]=;

                     }

                 }

         }

         return d[n]!=INF;

     }

     void mcf(){

         int x=INF;

         for(int i=from[t];i;i=from[E[i].from])

             x=min(x,E[i].v);

         for(int i=from[t];i;i=from[E[i].from]){

             E[i].v-=x;

             E[i^].v+=x;

             ans+=x*E[i].c;

         }

     }

     void build(){

         int t=cnt;

         for(int i=;i<=t;i+=)

             Add(E[i].from,E[i].to,INF,E[i].w);

     }

     void init(){

         n=getint(); m=getint(); k=getint();

         int x,y,z,w;

         cnt=;

         s=; t=n;

         F(i,,m){

             x=getint(); y=getint(); z=getint(); w=getint();

             add(x,y,z,w);

         }

         Dinic(); build();

         printf("%d ",ans);

         ans=; s=;

         ins(s,,k,);

         while(spfa()) mcf();

         printf("%d\n",ans);

     }

 }G1;

 int main(){

 #ifndef ONLINE_JUDGE

     freopen("1834.in","r",stdin);

     freopen("1834.out","w",stdout);

 #endif

     G1.init();

     return ;

 }