#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;
#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};
#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif
#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "["; REP(i, v.size()) out << v[i] << ", "; out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int n, k, c;
cin >> n >> k >> c;
vector<vi> a(n, vi(k));
REP(i, n){
cin >> a[i];
}
struct fracture{
vector<int> forced;
vector<int> excluded;
};
auto find_best = [&](fracture X){
vector<int> res(k, -1);
int pp = 0;
vector<bool> used(n, false);
REP(i, X.forced.size()) used[X.forced[i]] = true;
REP(i, X.excluded.size()) used[X.excluded[i]] = true;
REP(j, X.forced.size()) res[j] = X.forced[pp++];
FOR(i, pp, k, 1){
REP(j, n){
if(used[j]) continue;
if(res[i] == -1 || a[j][i] > a[res[i]][i])
res[i] = j;
}
if(res[i] == -1) return res;
used[res[i]] = true;
}
return res;
};
auto eval = [&](vector<int> bst){
int r = 0;
vector<int> res(k, -1);
REP(i, k){
if(bst[i] == -1) return -INF;
REP(j, k){
res[j] = max(res[j], a[bst[i]][j]);
}
}
REP(i, k){
r += res[i];
}
return r;
};
struct compare{
bool operator()(pair<int, fracture> l, pair<int, fracture> r){
return l.ff < r.ff;
}
};
priority_queue<pair<int, fracture>, vector<pair<int, fracture>>, compare> pq;
fracture init;
pq.push(mp(eval(find_best(init)), init));
vector<int> ans;
while(ans.size() < c){
auto tp = pq.top();
pq.pop();
int value = tp.ff;
fracture nf = tp.ss;
ans.pb(value);
vector<int> bst = find_best(nf);
FOR(j, nf.forced.size(), k, 1){
fracture nw;
nw.excluded = nf.excluded;
REP(i, j) nw.forced.pb(bst[i]);
nw.excluded.pb(bst[j]);
pq.push(mp(eval(find_best(nw)), nw));
}
}
cout << ans[c - 1] << "\n";
return 0;
}
