#include <cstdio>
#include <vector>
using namespace std;
typedef long long lld;

struct Awesome
{
    lld vert,dist;
};
vector<Awesome> Graph[100003];
vector<Awesome> Q;

lld n,m,k;

lld BFS(lld pokoki)
{
    Q.clear();
    lld cnt=0;
    lld indr=0,i;
    Awesome helper;

    helper.vert=1;
    helper.dist=0;
    Q.push_back(helper);

    while (indr<Q.size())
    {
        if (Q[indr].vert==n)
        {
            cnt++;
        }
        for (i=0;i<Graph[Q[indr].vert].size();i++)
        {
            if (Graph[Q[indr].vert][i].dist>pokoki) continue;
            helper.vert=Graph[Q[indr].vert][i].vert;
            Q.push_back(helper);
        }
        indr++;
    }
    return cnt;
}

int main ()
{
    lld i,j,ii,jj,ind,l,r,mid,v,ans=0;
    lld a,b,c,emin=99999999,emax=-1;
    Awesome helper;

    scanf("%lld %lld %lld",&n,&m,&k);
    for (i=1;i<=m;i++)
    {
        scanf("%lld %lld %lld",&a,&b,&c);
        helper.dist=c;

        helper.vert=b;
        Graph[a].push_back(helper);



        if (c<emin) emin=c;
        if (c>emax) emax=c;
    }
    l=emin;
    r=emax;

    while (l<=r)
    {
        mid=(l+r)/2;

        v=BFS(mid);
        if (v<k)
        {
            l=mid+1;
        }
        else
        {
            ans=mid;
            r=mid-1;
        }
    }
    printf("%lld\n",ans);
}
