#include <bits/stdc++.h>
using namespace std;
int n, m, k;
int mid = 0;
int num = 0;
int e[21][21];
int flag[21];
void dfs(int x, int sum) {
  if (x > n) {
    num = num + 1;
    return;
  }
  dfs(x + 1, sum);
  for (int y = 1; y <= n; y++) {
    if (num > k) {
      break;
    }
    if (flag[y] == 0 && e[x][y] != 0 && sum + e[x][y] <= mid) {
      flag[y] = 1;
      dfs(x + 1, sum + e[x][y]);
      flag[y] = 0;
    }
  }
  return;
}
int main() {
  int u, v, w;
  cin >> n >> m >> k;
  int l = 0;
  int h = 1000 * n;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      e[i][j] = 0;
    }
  }
  for (int i = 0; i < m; i++) {
    cin >> u >> v >> w;
    e[u][v] = w;
  }
  while (l < h) {
    mid = (l + h) / 2;
    num = 0;
    dfs(1, 0);
    if (num < k) {
      l = mid + 1;
    } else {
      h = mid;
    }
  }
  cout << l << endl;
}
