#include <bits/stdc++.h>
using namespace std;
const int mx=1e4+5,INF=2147483647,T=0;
const double eps=1e-5;
int n,m,s,t,u,v,w,p;
int head[mx],nxt[mx],to[mx],cnt=1,cur[mx];
double ANS=0,now[mx],dist[mx],_dist[mx];

inline void add_edge(int u,int v,int w){
	to[++cnt]=v;dist[cnt]=w;nxt[cnt]=head[u];head[u]=cnt;
	to[++cnt]=u;dist[cnt]=0;nxt[cnt]=head[v];head[v]=cnt;
}

int lv[mx];
queue <int> q;

inline bool bfs(){
	memset(lv,-1,sizeof lv);memcpy(cur,head,sizeof head);while(!q.empty())q.pop();
	
	lv[s]=0;q.push(s);
	
	while(!q.empty()){
		int u=q.front();q.pop();
		for(int i=head[u];i;i=nxt[i]){
			int v=to[i];double w=dist[i];
			if(w>0 && lv[v]==-1)
				lv[v]=lv[u]+1,q.push(v);
		}
	}
	return lv[t]!=-1;
}

inline double dfs(int u=s,double flow=INF){
	if(u==t)return flow;
	double ret=flow;
	for(int i=cur[u];i&&ret;i=nxt[i]){
		cur[u]=i;
		int v=to[i];double w=dist[i];
		if(w>0 && lv[v]==lv[u]+1){
			double c=dfs(v,min(ret,w));
			ret-=c;
			dist[i]-=c;dist[i^1]+=c;now[i]+=c;
		}
	}
	return flow-ret;
}

inline double dinic(double x){
	memcpy(_dist,dist,sizeof dist);
	for(int i=2;i<=cnt;i+=2){
		dist[i]=min(dist[i],x);
		//dist[i+1]=-dist[i];
	}
	double ans=0;
	while(bfs())ans+=dfs();
	memcpy(dist,_dist,sizeof dist);
	return ans;
}

inline bool check(double x){
	if(T)printf("    limit=%lf,ans=%lf\n",x,dinic(x));
	return dinic(x)==ANS;
}

int main()
{
	scanf("%d%d%d",&n,&m,&p);s=1;t=n;
	while(m--)scanf("%d%d%d",&u,&v,&w),add_edge(u,v,w);
	ANS=dinic(50000);
	
	double l=1,r=50000,mid=0;
	while(r-l>eps){
		mid=(l+r)/2;if(T)printf("  mid=%lf\n",mid);
		if(!check(mid))l=mid;
		else r=mid;
	}
	printf("%d\n%.4lf",(int)ANS,r*p);printf("\n");
	return 0;
}