#include <queue>

#include <cstdio>

#include <cstring>

#include <iostream>

#include <algorithm>

#define maxn 205

#define INF 0x7fffffff

using namespace std;

struct EdgeType {

    int v,l,e,f;

};

struct EdgeType edge[maxn*maxn*];

int s,t,deep[maxn];

int n,m,T,cnt=,head[maxn],maxl,minl=0x7fffffff;

char Cget;

inline void in(int &now)

{

    now=,Cget=getchar();

    while(Cget>''||Cget<'') Cget=getchar();

    while(Cget>=''&&Cget<='')

    {

        now=now*+Cget-'';

        Cget=getchar();

    }

}

bool bfs()

{

    queue<int>que;

    for(int i=s;i<=t;i++) deep[i]=-;

    deep[s]=,que.push(s);

    while(!que.empty())

    {

        int now=que.front();que.pop();

        for(int i=head[now];i;i=edge[i].e)

        {

            if(deep[edge[i].v]<&&edge[i].f>)

            {

                deep[edge[i].v]=deep[now]+;

                if(edge[i].v==t) return true;

                que.push(edge[i].v);

            }

        }

    }

    return false;

}

int flowing(int now,int flow)

{

    if(now==t||flow<=) return flow;

    int oldflow=;

    for(int i=head[now];i;i=edge[i].e)

    {

        if(deep[edge[i].v]!=deep[now]+||edge[i].f<=) continue;

        int pos=flowing(edge[i].v,min(flow,edge[i].f));

        if(pos>)

        {

            flow-=pos;

            oldflow+=pos;

            edge[i].f-=pos;

            edge[i^].f+=pos;

            if(flow==) return oldflow;

        }

    }

    if(oldflow==) deep[now]=-;

    return oldflow;

}

bool check(int pos)

{

    for(int i=;i<=cnt;i+=)

    {

        edge[i^].f=;

        if(edge[i].l<=pos) edge[i].f=;

        else edge[i].f=;

    }

    int ans=;

    while(bfs())

    ans+=flowing(s,INF);

    if(ans>=T) return true;

    else return false;

}

int main()

{

    in(n),in(m),in(T);

    int u,v,li;s=,t=n;

    while(m--)

    {

        in(u),in(v),in(li);if(li>maxl) maxl=li;if(li<minl) minl=li;

        edge[++cnt].v=v,edge[cnt].l=li,edge[cnt].e=head[u],head[u]=cnt;

        edge[++cnt].v=u,edge[cnt].l=li,edge[cnt].e=head[v],head[v]=cnt;

        edge[++cnt].v=u,edge[cnt].l=li,edge[cnt].e=head[v],head[v]=cnt;

        edge[++cnt].v=v,edge[cnt].l=li,edge[cnt].e=head[u],head[u]=cnt;

    }

    int l=minl,r=maxl,ans,mid;

    while(l<=r)

    {

        mid=(l+r)>>;

        if(check(mid)) ans=mid,r=mid-;

        else l=mid+;

    }

    cout<<ans;

    return ;

}