1 #include<iostream>
  2 #include<cstdio>
  3 #include<cstring>
  4 #include<algorithm>
  5 #include<queue>
  6 #include<cmath>
  7 #define inf 100000000
  8 using namespace std;
  9 const int E=1000000;
 10 const int N=10002;
 11 struct Node{
 12     int v, cap, cost, next;    //  re记录逆边的下标。
 13 }edge[E];
 14 int n, m;
 15 long long ans,people;
 16 int k, head[N];
 17 int que[N], pre[N], dis[N];
 18 bool vis[N];
 19 void init(){//初始化
 20    k=ans=0;
 21    memset(head,-1,sizeof(head));
 22 }
 23 void addEdge(int u, int v, int ca, int co){
 24     edge[k].v = v;
 25     edge[k].cap = ca;
 26     edge[k].cost = co;
 27     edge[k].next = head[u];
 28     head[u] = k ++;
 29     edge[k].v = u;
 30     edge[k].cap = 0;
 31     edge[k].cost = -co;
 32     edge[k].next = head[v];
 33     head[v] = k ++;
 34 }
 35 bool spfa(){                  //  源点为0，汇点为n。
 36     int i;
 37     for(i = 1; i <= n; i ++){
 38         dis[i] = inf;
 39         vis[i] = false;
 40     }
 41     queue<int>Q;
 42     Q.push(1);
 43     dis[1]=0;
 44     vis[1] = true;
 45     while(!Q.empty()){       //  这里最好用队列，有广搜的意思，堆栈像深搜。
 46         int u = Q.front();
 47         Q.pop();
 48         for(i = head[u]; i != -1; i = edge[i].next){
 49             int v = edge[i].v;
 50             if(edge[i].cap && dis[v] > dis[u] + edge[i].cost){
 51                 dis[v] = dis[u] + edge[i].cost;
 52                 pre[v] = i;
 53                 if(!vis[v]){
 54                     vis[v] = true;
 55                    Q.push(v);
 56                 }
 57             }
 58         }
 59         vis[u] = false;
 60     }
 61     if(dis[n] == inf) return false;
 62     return true;
 63 }
 64 int  end(){
 65     int u, p, sum = inf;
 66     for(u = n; u != 1; u = edge[p^1].v){//0是超级源点
 67         p = pre[u];
 68         sum = min(sum, edge[p].cap);
 69     }
 70     for(u = n; u != 1; u = edge[p^1].v){
 71         p = pre[u];
 72         edge[p].cap -= sum;
 73         edge[p^1].cap += sum;
 74     }
 75     return sum;
 76 }
 77 int main(){
 78     int t1,t2,t3;
 79    while(~scanf("%d%d%d",&n,&m,&people)&&n>0){
 80         init();//初始化
 81        for(int i=1;i<=m;i++){
 82         scanf("%d%d%d",&t1,&t2,&t3);
 83           t1++;t2++;
 84           addEdge(t1,t2,t3,1);//无向图要建边两次
 85        }
 86        long long s=people,now=0,sum=0;
 87        ans=inf;
 88        while(spfa()){
 89           int y=end();
 90            s-=((long long)dis[n]-now)*sum+y;
 91            if(s<0)s=0;
 92            sum+=y;now=dis[n];
 93            long long temp=(long long)now+(long long)ceil(s*1.0/sum);
 94            if(temp<ans)ans=temp;
 95        }
 96        if(people==0)ans=0;
 97        if(ans==inf)printf("No solution\n");
 98        else
 99        printf("%I64d\n",ans);
100    }
101 }