#include <bits/stdc++.h>

#define MAX_N 100

#define FastIO ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define all(x) x.begin(), x.end()

typedef long long ll;

using namespace std;

const ll INF = ~(1LL << 63);

ll N, M, K, G[MAX_N + 1][MAX_N + 1];
bool vis[MAX_N + 1];
unordered_map<ll,array<ll,2>> states;

void walk(ll node, ll k, ll cap, ll max_cap) {
    if(cap < 0)
        return;

    auto found = states.find(node);

    if(found != states.end() && ((found->second[0] > k && found->second[1] > cap) || (found->second[0] == k && found->second[1] > cap) || (found->second[0] > k && found->second[1] == cap)))
        return;

    if(found == states.end())
        states[node] = { k, cap };
    else {
        found->second[0] = max(k, found->second[0]);
        found->second[1] = max(cap, found->second[1]);
    }

    vis[node] = true;

    if(k > 0)
        walk(node, k - 1, max_cap, max_cap);

    for(ll i = 1; i <= MAX_N; i++) {
        if(G[node][i])
            walk(i, k, cap - G[node][i], max_cap);
    }
}

int main()
{
    FastIO;
    ll n1, n2, C;
    set<ll> caps;
    cin >> N >> M >> K;
    for(ll i = 0; i < M; i++) {
        cin >> n1 >> n2 >> C;
        G[n1][n2] = C;
        G[n2][n1] = C;
        caps.insert(C);
    }
    set<ll>::iterator it;
    for(it = caps.begin(); it != caps.end(); it++) {
        fill(vis + 1, vis + N + 1, false);
        states.clear();
        walk(1, K, 0, *it);
        if(all_of(vis + 1, vis + N + 1, [](auto &a) { return a; })) {
            cout << *it << '\n';
            break;
        }
    }
    return 0;
}