费用刘

二分一个费用
限制上限，跑最大流

// luogu-judger-enable-o2
#include<cstdio>
#define ll long long
#include<cstring> 
#include<queue>
using namespace std;
const int M=10000,inf=0x7fffffff;
const ll INF=1ll<<60;
int S,T,n,m;int x[M],y[M],z[M];
int nex[M*2],to[M*2],head[M],tot,cur[M],p;
int dep[M];ll maxn,cap[M*2];
void add(int x,int y,ll z){
    nex[++tot]=head[x];cap[tot]=z;
    to[tot]=y;head[x]=tot;
}
void init(){
    memset(head,0,sizeof head);tot=1;
}
struct dinic{
    queue<int>q;
    int bfs(){memset(dep,0,sizeof dep);
        while(!q.empty())q.pop();
        q.push(S);dep[S]=1;
        while(!q.empty()){
            int x=q.front();q.pop();
            for(int i=head[x],tmp;i<=tot&&i>=2;i=nex[i]){

                if(!dep[tmp=to[i]]&&cap[i])
                dep[tmp]=dep[x]+1,q.push(tmp);

            }
        } 
        return dep[T];
    }
    ll dfs(int x,ll minf){
        if(x==T) return minf;ll f;
        for(int &i=cur[x],tmp;i<=tot&&i>=2;i=nex[i]){
            if(dep[tmp=to[i]]==dep[x]+1&&cap[i]&&(f=dfs(tmp,min(cap[i],minf)))){
                cap[i]-=f;
                cap[i^1]+=f;
                return f;
            }
        }
        return 0;
    }
    ll danic(){ll ans=0,f;
        while(bfs()) {f=1;
            for(int i=S;i<=T;i++) cur[i]=head[i];
            while(f)ans+=(f=dfs(S,INF));
        }

        return ans;
    }
}A;
bool check(ll t){init();
    for(int i=1;i<=m;i++) add(x[i],y[i],min(t,z[i]*10000ll)),add(y[i],x[i],0);
    return A.danic()==maxn;
}
int main(){
    scanf("%d%d%d",&n,&m,&p);S=1,T=n;init();
    for(int i=1;i<=m;i++) scanf("%d%d%d",&x[i],&y[i],&z[i]),add(x[i],y[i],z[i]*10000ll),add(y[i],x[i],0);
    maxn=A.danic();printf("%lld ",maxn/10000);
    ll l=1,r=1000000000ll;
    while(l<=r){ll mid=(l+r)>>1;
        if(check(mid)) r=mid-1;else l=mid+1;
    }
    printf("%.4lf",(double)l*p/10000.0);
}