#include using namespace std; #define rep(i,n) for (int i = 0; i < int(n); i++) #define rep1(i,n) for (int i = 1; i <= int(n); i++) #define repR(i,n) for (int i = int(n)-1; i >= 0; i--) #define rep1R(i,n) for (int i = int(n); i >= 1; i--) #define loop(i,a,B) for (int i = a; i B; i++) #define loopR(i,a,B) for (int i = a; i B; i--) #define all(x) (x).begin(), (x).end() #define allR(x) (x).rbegin(), (x).rend() #define eb emplace_back #define mp make_pair #define fst first #define snd second #ifdef LOCAL #define dump(...) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] ", my_dmp(#__VA_ARGS__, __VA_ARGS__) void my_dmp(const char*) { cerr << endl; } template void my_dmp(const char *s, T const& x, U const& ...y) { const char *o = "({[", *e = "]})"; for (int i = 0; *s != '\0'; cerr << *s++) { if (count(o,o+3,*s)) i++; if (count(e,e+3,*s)) i--; if (!i && *s == ',') break; } cerr << " = " << x; if (*s == ',') cerr << ", ", s++; my_dmp(s, y...); } #else #define dump(...) #endif using ll = long long; #define int ll template using pque_max = priority_queue; template using pque_min = priority_queue, greater >; template ::value>::type> ostream& operator<<(ostream& os, T const& v) { os << "{"; for (auto const& x : v) os << " " << x; return os << " }"; } template istream& operator>>(istream& is, vector& v) { for (auto& x : v) is >> x; return is; } template ostream& operator<<(ostream& os, pair const& p) { return os << "(" << p.first << ", " << p.second << ")"; } template istream& operator>>(istream& is, pair& p) { return is >> p.first >> p.second; } struct my_Init { my_Init() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } my_init; template ::type> constexpr auto make_v(T const& x = {}) { return x; } template 0)>::type> constexpr auto make_v(size_t n, U... x) { auto val = make_v(x...); return vector(n, move(val)); } template void quit(T const& x) { cout << x << endl; exit(0); } template constexpr bool chmin(T& x, T const& y) { if (x > y) { x = y; return true; } return false; } template constexpr bool chmax(T& x, T const& y) { if (x < y) { x = y; return true; } return false; } template constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits::value_type{}); } const ll INF = (1LL<<62)-1; // ~ 4.6e18 //////////////////////////////// int32_t main() { int n,m,k; cin >> n >> m >> k; auto a = make_v(n,m); rep (i,n) rep (j,m) cin >> a[i][j]; const int NN = 500+10; vector dp(NN),t(NN); dp[0] = 1; rep (i,n) { rep (x,NN) t[x] = 0; rep (x,NN) rep (j,m) { if (dp[x] && x+a[i][j] < NN) t[x+a[i][j]] = 1; } swap(dp,t); } int x = k; for ( ; x >= -1; x--) { if (x == -1) { cout << -1 << "\n"; return 0; } else if (dp[x]) { cout << k-x << "\n"; return 0; } } }