#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void umax(T &a, T b) {
  if (a < b) a = b;
}
template <class T>
inline void umin(T &a, T b) {
  if (a > b) a = b;
}
template <class T>
inline T abs(T a) {
  return a > 0 ? a : -a;
}
template <class T>
inline T gcd(T a, T b) {
  return __gcd(a, b);
}
template <class T>
inline T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
long long modpow(long long a, long long n, long long temp) {
  long long res = 1, y = a;
  while (n > 0) {
    if (n & 1) res = (res * y) % temp;
    y = (y * y) % temp;
    n /= 2;
  }
  return res % temp;
}
long long ison(long long mask, long long pos) { return (mask & (1 << pos)); }
long long cbit(long long n) {
  long long k = 0;
  while (n) n &= (n - 1), k++;
  return k;
}
long long nbit(long long n) {
  long long k = 0;
  while (n) n /= 2, k++;
  return k;
}
long long mod = 1e9 + 7;
int sgn(long long x) { return x < 0 ? -1 : !!x; }
const double eps = 1e-7;
const double pi = acos(-1.0);
inline void inc(long long &x, long long y) {
  x += y;
  if (x >= mod) x -= mod;
}
inline void dec(long long &x, long long y) {
  x -= y;
  if (x < 0) x += mod;
}
inline void chmax(long long &x, long long y) {
  if (y > x) x = y;
}
inline void mulm(long long &x, long long y) {
  x *= y;
  if (x >= mod) x -= mod;
}
long long xo(long long i) {
  if ((i & 3) == 0) return i;
  if ((i & 3) == 1) return 1;
  if ((i & 3) == 2) return i + 1;
  return 0;
}
vector<pair<long long, long long> > adj[200005];
priority_queue<long long> q;
long long vis[200005];
long long n, m, t, c = 0;
void solve(long long ind) {
  if (ind == n) {
    q.push(c);
    if (q.size() > t) q.pop();
    return;
  }
  solve(ind + 1);
  for (long long i = 0; i < adj[ind].size(); i++) {
    if (vis[adj[ind][i].first] == 0) {
      vis[adj[ind][i].first] = 1;
      c += adj[ind][i].second;
      if (q.size() < t || c < q.top()) solve(ind + 1);
      c -= adj[ind][i].second;
      vis[adj[ind][i].first] = 0;
    }
  }
}
int main() {
  long long r, s = 0, x, i, j, k, l, m;
  cin >> n >> m >> t;
  while (m--) {
    long long x, y, w;
    cin >> x >> y >> w;
    x--, y--;
    adj[x].push_back(make_pair(y, w));
  }
  solve(0);
  cout << q.top();
}
