#include<cstdio>

 #include<cstring>

 #include<algorithm>

 using namespace std;

 const int INF=<<;

 int inline readint(){

 //    int Num;char ch;

 //    while((ch=getchar())<'0'||ch>'9');Num=ch-'0';

 //    while((ch=getchar())>='0'&&ch<='9') Num=Num*10+ch-'0';

 //    return Num;

     int Num;

     scanf("%d",&Num);

     return Num;

 }

 int N,M,X;

 int to[],ne[],c[],fir[],cnt=;

 void Add(int x,int y,int z){

     to[cnt]=y,ne[cnt]=fir[x],c[cnt]=z,fir[x]=cnt++;

     to[cnt]=x,ne[cnt]=fir[y],c[cnt]=,fir[y]=cnt++;

 }

 int S,T;

 int bfn[],ti=;

 int cur[],q[],dep[];

 bool Bfs(){

     int head=,tail=;

     q[]=S;

     bfn[S]=++ti;

     dep[S]=;

     int u;

     while(head<=tail){

         u=q[head++];

         for(int i=fir[u];i!=-;i=ne[i]){

             int v=to[i];

             if(bfn[v]!=bfn[u]&&c[i]){

                 bfn[v]=bfn[u];

                 dep[v]=dep[u]+;

                 q[++tail]=v;

             }

         }

     }

     return bfn[T]==bfn[S];

 }

 int Dfs(int u,int mxf){

     if(!mxf||u==T) return mxf;

     int flow=,f;

     for(int &i=cur[u];i!=-;i=ne[i]){

         int v=to[i];

         if(dep[v]==dep[u]+&&(f=Dfs(v,min(mxf,c[i])))>){

             c[i]-=f;

             c[i^]+=f;

             flow+=f;

             mxf-=f;

             if(!mxf) break;

         }

     }

     return flow;

 }

 int Dinic(){

     int ret=;

     while(Bfs()){

         memcpy(cur,fir,sizeof(fir));

         ret+=Dfs(S,INF);

     }

     return ret;

 }

 int main(){

     N=readint();

     M=readint();

     X=readint();

     S=;

     T=N;

     memset(fir,-,sizeof(fir));

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

         int a=readint(),

             b=readint(),

             c=readint();

         Add(a,b,c);

     }

     int mx=Dinic();

     if(!mx){

         puts("Orz Ni Jinan Saint Cow!");

         return ;

     }

     printf("%d %d\n",mx,X/mx+(X%mx?:));

     return ;

 }