#include<bits/stdc++.h>
using namespace std;
const int N=105,M=1005,INF=0x3f3f3f3f;
namespace Flow{
	int s,t,head[N],cnt,cur[N],d[N],qe[N];
	struct edge{
		int v,cap,flow,next;
	}e[M<<1];
	void add_edge(int u,int v,int cap,int flow){
		e[cnt]=edge{v,cap,flow,head[u]};
		head[u]=cnt++;
	}
	void Add_Edge(int u,int v,int cap){
		add_edge(u,v,cap,0);
		add_edge(v,u,0,0);
	}
	void init(int ss,int tt){
		s=ss;
		t=tt;
		memset(head,255,sizeof(head));
		cnt=0;
	}
	bool BFS(){
		memcpy(cur,head,sizeof(head));
		memset(d,255,sizeof(d));
		int l=0,r=0;
		qe[r++]=s;
		d[s]=0;
		while(l<r){
			int u=qe[l++];
			for(int i=head[u];~i;i=e[i].next){
				const int v=e[i].v;
				if(e[i].cap>e[i].flow && d[v]==-1){
					d[v]=d[u]+1;
					qe[r++]=v;
					if(v==t) return true;
				}
			}
		}
		return false;
	}
	int DFS(int u,int now){
		if(u==t) return now;
		int flow=0;
		for(int i=cur[u];~i && now>0;i=cur[u]){
			const int v=e[i].v;
			cur[u]=e[i].next;
			if(e[i].cap>e[i].flow && d[v]==d[u]+1){
				const int t=DFS(v,min(now,e[i].cap-e[i].flow));
				flow+=t;
				now-=t;
				e[i].flow+=t;
				e[i^1].flow-=t;
				if(t==0) d[v]=-1;
			}
		}
		return flow;
	}
	int Dinic(){
		int flow=0;
		while(BFS()) flow+=DFS(s,INF);
		return flow;
	}
}
struct edge{
	int u,v,w;
}e[M];
int ff,n,m,P;
bool check(int mid){
	Flow::init(0,n-1);
	for(int i=0;i<m;++i) Flow::Add_Edge(e[i].u,e[i].v,min(e[i].w,mid));
	return (Flow::Dinic()==ff); 
}
int main(){
	ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
	cin >> n >> m >> P;
	for(int i=0;i<m;++i){
		cin >> e[i].u >> e[i].v >> e[i].w;
		--e[i].u;
		--e[i].v;
	}
	Flow::init(0,n-1);
	for(int i=0;i<m;++i) Flow::Add_Edge(e[i].u,e[i].v,e[i].w);
	cout << (ff=Flow::Dinic()) << '\n';
	int l=0,r=1000000005,ans=-1;
	while(l<r){
		int mid=l+(r-l)/2;
		if(check(mid)){
			ans=mid;
			r=mid;
		}else l=mid+1;
	}
	cout << ans*P << endl;
	return 0;
}