#include <bits/stdc++.h>
using namespace std;
int N, K, T, map[21][21], visit[21], W, w[1000000];
inline int read() {
  char ch = getchar();
  int x = 0;
  bool flag = 0;
  for (; ch != '-' && (ch < '0' || ch > '9'); ch = getchar())
    ;
  if (ch == '-') {
    flag = 1;
    ch = getchar();
  }
  for (; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + ch - '0';
  if (flag) return -x;
  return x;
}
void dfs(int x, int y) {
  if (x == N + 1) {
    w[++W] = y;
    return;
  }
  dfs(x + 1, y);
  for (int i = 1; i <= N; ++i)
    if (!visit[i]) {
      visit[i] = 1;
      dfs(x + 1, y + map[x][i]);
      visit[i] = 0;
    }
}
int main() {
  N = read();
  K = read();
  T = read();
  for (int i = 1; i <= K; ++i) {
    int x = read(), y = read();
    map[x][y] = read();
  }
  dfs(1, 0);
  sort(w + 1, w + W + 1);
  printf("%d\n", w[T]);
  return 0;
}
