#include<cstdio>

#include<cstdlib>

#include<cctype>

#include<algorithm>

#include<cstring>

#include<queue>

#define maxn 2000

#define maxm 10000

using namespace std;

inline long long read(){

    long long num=,f=;

    char ch=getchar();

    while(!isdigit(ch)){

        if(ch=='-')    f=-;

        ch=getchar();

    }

    while(isdigit(ch)){

        num=num*+ch-'';

        ch=getchar();

    }

    return num*f;

}

inline int count(int i){    return i&?i+:i-;    }

struct Edge{

    int from,next,to,dis,val,flow;

}edge[maxm*];

int head[maxn],num;

inline void addedge(int from,int to,int dis,int val){

    edge[++num]=(Edge){from,head[from],to,dis,val,};

    head[from]=num;

}

inline void add(int from,int to,int dis,int val){

    addedge(from,to,dis,val);

    addedge(to,from,-dis,);

}

int dfn[maxn];

bool vis[maxn];

int Start,End;

int list[maxn];

bool bfs(){

    memset(vis,,sizeof(vis));

    dfn[Start]=;    vis[Start]=;

    queue<int>q;    q.push(Start);

    while(!q.empty()){

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

        for(int i=head[from];i;i=edge[i].next){

            int to=edge[i].to;

            if(edge[i].val==edge[i].flow||vis[to])    continue;

            vis[to]=;

            dfn[to]=dfn[from]+;    q.push(to);

        }

    }

    return vis[End];

}

int dfs(int x,int val){

    if(x==End||val==)    return val;

    int flow=;    vis[x]=;

    for(int &i=list[x];i;i=edge[i].next){

        int to=edge[i].to;

        if(edge[i].val==edge[i].flow||vis[to]||dfn[to]!=dfn[x]+)    continue;

        int now=dfs(to,min(val,edge[i].val-edge[i].flow));

        edge[i].flow+=now;    edge[count(i)].flow-=now;    val-=now;    flow+=now;

        if(val<=)    break;

    }

    if(flow!=val)    dfn[x]=-;

    return flow;

}

int dis[maxn];

int pre[maxn];

int spfa(){

    memset(dis,/,sizeof(dis));    dis[Start]=;

    memset(vis,,sizeof(vis));

    queue<int>q;    q.push(Start);

    while(!q.empty()){

        int from=q.front();    q.pop();    vis[from]=;

        for(int i=head[from];i;i=edge[i].next){

            int to=edge[i].to;

            if(edge[i].val>edge[i].flow){

                if(dis[to]<=dis[from])    continue;

                dis[to]=dis[from];

            }

            else{

                if(edge[i].dis<)    continue;

                if(dis[to]<=dis[from]+edge[i].dis)    continue;

                dis[to]=dis[from]+edge[i].dis;

            }

            pre[to]=i;

            if(vis[to])    continue;

            vis[to]=;    q.push(to);

        }

    }

    int now=End;

    while(now!=Start&&now){

        int ret=pre[now];

        if(edge[ret].val==edge[ret].flow)    edge[ret].val++;

        edge[ret].flow++;    edge[count(ret)].flow--;

        now=edge[ret].from;

    }

    return dis[End];

}

int main(){

    int n=read(),m=read(),e=read();End=n;Start=;

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

        int a=read(),b=read(),c=read(),d=read();

        add(a,b,d,c);

    }

    int ans=;

    while(bfs()){

        memset(vis,,sizeof(vis));

        for(int i=;i<=n;++i)    list[i]=head[i];

        int now=dfs(Start,0x7fffffff);

        if(!now)    break;

        ans+=now;

    }

    printf("%d",ans);

    long long now=;

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

        now+=spfa();

    printf(" %lld",now);

    return ;

}