#include <bits/stdc++.h>
using namespace std;
const int N = 21;
int n, k, t, x, y, w;
bool u[N];
vector<pair<int, int> > g[N];
priority_queue<int> q;
void calc(int ph, int sum) {
  if (ph == n) {
    q.push(sum);
    if (q.size() > t) q.pop();
  } else {
    calc(ph + 1, sum);
    for (int i = 0; i < (int)g[ph].size(); i++) {
      int pw = g[ph][i].first, w = g[ph][i].second;
      if (!u[pw]) {
        u[pw] = true;
        if (q.size() < t || sum + w <= q.top()) calc(ph + 1, sum + w);
        u[pw] = false;
      }
    }
  }
}
int main() {
  cin >> n >> k >> t;
  for (int i = 0; i < k; i++) {
    scanf("%d%d%d", &x, &y, &w);
    g[x - 1].push_back(make_pair(y - 1, w));
  }
  calc(0, 0);
  cout << q.top();
  return 0;
}
