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

#define ll long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second

const int inf = 1e9 + 7;

int n, m, k;
int h[41][41];
vector<vector<vector<int> > > dp;

void solve() {
    cin >> n >> m >> k;
    dp.assign(1 + n, vector<vector<int> > (1 + m, vector<int> (1 + k, inf)));
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) {
            cin >> h[i][j];
        }
    }
    dp[0][1][0] = 0;
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= n; j++) {
            int cur_h = h[i][j];
            for(int add = 0; add <= k; add++) {
                for(int ori = 0; ori + add <= k; ori++) {
                    dp[i][j][ori + add] = min({dp[i][j][ori + add], dp[i - 1][j][ori] + cur_h, dp[i][j - 1][ori] + cur_h});
                }
                cur_h /= 2;
            }
        }
    }
    cout << dp[n][m][k] << "\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}