#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
struct node
{
    int x,y,d,next,other;
}a[110000];int len,last[210];
int st,ed,h[210],list[210];
void ins(int x,int y,int c)
{
    int k1,k2;
    len++;k1=len;
    a[len].x=x;a[len].y=y;a[len].d=c;
    a[len].next=last[x];last[x]=len;
    len++;k2=len;
    a[len].x=y;a[len].y=x;a[len].d=c;
    a[len].next=last[y];last[y]=len;
    a[k1].other=k2;
    a[k2].other=k1;
}
bool bt_h()
{
    memset(h,0,sizeof(h));h[st]=1;
    list[1]=st;int head=1,tail=2;
    while(head!=tail)
    {
        int x=list[head];
        for(int k=last[x];k;k=a[k].next)
        {
            int y=a[k].y;
            if(a[k].d>0&&h[y]==0)
            {
                h[y]=h[x]+1;
                list[tail]=y;
                tail++;
            }
        }
        head++;
    }
    if(h[ed]>0)return true;
    return false;
}
int findflow(int x,int f)
{
    if(x==ed)return f;
    int s=0;
    for(int k=last[x];k;k=a[k].next)
    {
        int y=a[k].y;
        if(a[k].d>0&&h[y]==(h[x]+1)&&s<f)
        {
            int t=findflow(y,min(a[k].d,f-s));
            s+=t;a[k].d-=t;a[a[k].other].d+=t;
        }
    }
    if(s==0)h[x]=0;
    return s;
}
struct bian
{
    int x,y,d;
}b[41100];int P;
int check(int x)
{
    len=0;memset(last,0,sizeof(last));
    for(int i=1;i<=P;i++)
        if(b[i].d<=x)ins(b[i].x,b[i].y,1);
    int ans=0;
    while(bt_h()==true)
    {
        ans+=findflow(st,999999999);
    }
    return ans;
}
int main()
{
    int n,T;scanf("%d%d%d",&n,&P,&T); 
    st=1;ed=n;
    int l=999999999,r=0,mid,ans=0;
    for(int i=1;i<=P;i++)
    {
        scanf("%d%d%d",&b[i].x,&b[i].y,&b[i].d);
        r=max(r,b[i].d);
        l=min(l,b[i].d);
    }
    while(l<=r)
    {
        mid=(l+r)/2;
        if(check(mid)>=T)
        {
            r=mid-1;
            ans=mid; 
        }
        else l=mid+1;
    }
    printf("%d\n",ans);
    return 0;
}