#include <bits/stdc++.h>

#define N 210 

#define M 40010 

using namespace std;

int head[N], to[M << 2], nxt[M << 2], val[M << 2], tot;

queue<int >q;

int dis[N], n, m, t, S, T;

struct Edge {
	int x, y, z;
}e[M];

char *p1, *p2, buf[100000];

#define nc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2) ? EOF : *p1 ++ )

int rd() {
	int x = 0, f = 1;
	char c = nc();
	while (c < 48) {
		if (c == ‘-‘)
			f = -1;
		c = nc();
	}
	while (c > 47) {
		x = (((x << 2) + x) << 1) + (c ^ 48), c = nc();
	}
	return x * f;
}

inline void add(int x, int y, int z) {
	to[ ++ tot] = y;
	val[tot] = z;
	nxt[tot] = head[x];
	head[x] = tot;

	to[ ++ tot] = x;
	val[tot] = 0;
	nxt[tot] = head[x];
	head[x] = tot;
}

bool bfs() {
	while (!q.empty())
		q.pop();
	memset(dis, -1, sizeof dis);
	dis[S] = 0;
	q.push(S);
	while (!q.empty()) {
	   int x = q.front();
	   q.pop();
	   for (int i = head[x]; i; i = nxt[i]) {
		   if (dis[to[i]]  == -1 && val[i]) {
			   dis[to[i]] = dis[x] + 1;
			   if (to[i] == T)
				   return true;
			   q.push(to[i]);
		   }
	   }
   }
   return false;
}

int dinic(int x, int fl) {
	int tmp = fl;
	if (x == T)
		return fl;
	for (int i = head[x]; i; i = nxt[i]) {
		if (dis[to[i]] == dis[x] + 1 && val[i]) {
			int mdl = dinic(to[i], min(tmp, val[i]));
			if (!mdl) dis[to[i]] = -1;
			tmp -= mdl, val[i] -= mdl, val[i ^ 1] += mdl;
			if(!tmp) break;
		}
	}
	return fl - tmp;
}

void build(int x) {
	for (int i = 1; i <= m; i ++ ) {
		if (e[i].z <= x) {
			add(e[i].x, e[i].y, 1);
			add(e[i].y, e[i].x, 1);
		}
	}
}

bool check(int x) {
	memset(head, 0, sizeof head);
	tot = 1;
	build(x);
	int ans = 0;
	while (bfs()) {
		ans += dinic(1, 1 << 30);
	}
	return ans >= t;
}

int main() {
	n = rd(), m = rd(), t = rd();
	S = 1, T = n;
	for (int i = 1; i <= m; i ++ ) {
		e[i].x = rd(), e[i].y = rd(), e[i].z = rd();
	}
	int l = 1, r = 1000001;
	while (l < r) {
		int mid = (l + r) >> 1;
		if (check(mid))
			r = mid;
		else
			l = mid + 1;
	}
	printf("%d\n", r);
	return 0;
}