#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
struct fastio {
  char s[100000];
  int it, len;
  fastio() { it = len = 0; }
  inline char get() {
    if (it < len) return s[it++];
    it = 0;
    len = fread(s, 1, 100000, stdin);
    if (len == 0)
      return EOF;
    else
      return s[it++];
  }
  bool notend() {
    char c = get();
    while (c == ' ' || c == '\n') c = get();
    if (it > 0) it--;
    return c != EOF;
  }
} _buff;
inline long long getnum() {
  long long r = 0;
  bool ng = 0;
  char c;
  c = _buff.get();
  while (c != '-' && (c < '0' || c > '9')) c = _buff.get();
  if (c == '-') ng = 1, c = _buff.get();
  while (c >= '0' && c <= '9') r = r * 10 + c - '0', c = _buff.get();
  return ng ? -r : r;
}
template <class T>
inline void putnum(T x) {
  if (x < 0) putchar('-'), x = -x;
  register short a[20] = {}, sz = 0;
  while (x) a[sz++] = x % 10, x /= 10;
  if (sz == 0) putchar('0');
  for (int i = sz - 1; i >= 0; i--) putchar('0' + a[i]);
}
inline char getreal() {
  char c = _buff.get();
  while (c <= 32) c = _buff.get();
  return c;
}
long long qpow(long long x, long long k) {
  return k == 0 ? 1
                : 1ll * qpow(1ll * x * x % mod, k >> 1) * (k & 1 ? x : 1) % mod;
}
int n, K;
vector<pair<pair<int, int>, int> > E;
int tot;
struct state {
  bool vis0[22], vis1[22];
  int lst;
} st[200111];
vector<pair<int, int> > B[100111];
int get_state(int from, int x) {
  int p;
  if (from == -1) {
    p = 0;
  } else {
    p = ++tot;
    state &cur = st[p];
    cur = st[from];
    cur.vis0[E[x].first.first] = cur.vis1[E[x].first.second] = 1;
    cur.lst = x + 1;
  }
  return p;
}
int solve() {
  B[0].push_back(make_pair(-1, -1));
  for (int i = 0; K > 0 && i <= 100000; i++) {
    for (int j = 0; K > 0 && j < B[i].size(); j++) {
      int cur = get_state(B[i][j].first, B[i][j].second);
      K--;
      if (K == 0) return i;
      for (int k = st[cur].lst; k < E.size(); k++) {
        if (!st[cur].vis0[E[k].first.first] &&
            !st[cur].vis1[E[k].first.second]) {
          B[i + E[k].second].push_back(make_pair(cur, k));
        }
      }
    }
  }
  assert(false);
}
int main() {
  int m;
  n = getnum(), m = getnum(), K = getnum();
  for (int i = 1; i <= m; i++) {
    int x, y, w;
    x = getnum(), y = getnum(), w = getnum();
    E.push_back(make_pair(make_pair(x, y), w));
  }
  cout << solve() << endl;
  return 0;
}
