#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int,int> P;

#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();;++(it)) {if ((it) == map.end()) {cout << "}\n";break;}else cout << "" << (it)->first << "=>" << (it)->second << ", ";}}while(0)

int main() {
    int n,m,k;
    cin >> n >> m >> k;
    vector<vector<bool>> dp(n+1,vector<bool>(510,false));
    dp[0][0] = true;
    for (int i = 0;i < n;++i) {
        for (int j = 0;j < m;++j) {
            int a;
            cin >> a;
            for (int l = 0;l < k;++l) if (dp[i][l]) dp[i+1][l+a] = true;
        }
    }
    for (int i = k;i >= 0;--i) if (dp[n][i]) {
        cout << k-i << endl;
        return 0;
    }
    cout << -1 << endl;
    return 0;
}