#include <bits/stdc++.h>
using namespace std;
int l = 0, A[100001], c[21] = {0}, a[21][21] = {0};
void rekurs(int n, int i, int s) {
  int j, p;
  if (i > n) {
    l++;
    A[l] = s;
  } else {
    p = 0;
    for (j = 1; j <= n; j++)
      if (a[i][j] != 0 && c[j] == 0) {
        p = 1;
        c[j] = 1;
        s += a[i][j];
        rekurs(n, i + 1, s);
        c[j] = 0;
        s -= a[i][j];
      }
    if (p == 0) rekurs(n, i + 1, s);
  }
}
int main() {
  int n, m, t, k, i, x, y;
  scanf("%d%d%d", &n, &m, &t);
  l++;
  A[l] = 0;
  for (i = 1; i <= m; i++) {
    scanf("%d%d%d", &x, &y, &k);
    a[x][y] = k;
    l++;
    A[l] = k;
  }
  rekurs(n, 1, 0);
  sort(A + 1, A + 1 + l);
  printf("%d", A[t]);
  return 0;
}
