#include using namespace std; #define rep(i, n) for(int i = 0; i < (int)n; ++i) #define FOR(i, a, b) for(int i = a; i < (int)b; ++i) #define rrep(i, n) for(int i = ((int)n - 1); i >= 0; --i) typedef long long ll; typedef long double ld; const int Inf = 1e9; const double EPS = 1e-9; const int MOD = 1e9 + 7; int n, m, k; vector > a; vector pre, suf; void dfs(int pos, int lim, int c) { if (pos == lim) { if (lim == n) suf.push_back(c); else pre.push_back(c); return; } rep (i, m) { dfs(pos + 1, lim, c + a[pos][i]); } } int main() { cin.tie(nullptr); ios::sync_with_stdio(0); cin >> n >> m >> k; a = vector >(n, vector(m)); rep (i, n) rep (j, m) cin >> a[i][j]; dfs(0, n / 2, 0); dfs(n / 2, n, 0); sort(suf.begin(), suf.end()); int tmp = -1; rep (i, pre.size()) { if (pre[i] > k) continue; auto x = upper_bound(suf.begin(), suf.end(), k - pre[i]); if (x != suf.begin() && pre[i] + *(x - 1) <= k) { tmp = max(tmp, pre[i] + *(x - 1)); } } if (tmp == -1) cout << -1 << endl; else cout << k - tmp << endl; return 0; }