#include <bits/stdc++.h>

using namespace std;


int main() {

    int a, b, c;
    cin >> a >> b >> c;
    vector<vector<int>> oszlop(a+1, vector<int>(b+1)), // saving the rows and columns
    dp(a+1, vector<int>(b+1,INT_MAX)), backtrack(a+1, vector<int>(b+1)); // backtrack saves the shortest path
    
    for(int i = 1;i<=a;i++ ) {
        for(int z = 1;z<=b;z++ ) {
            cin >> oszlop[i][z];
        }
    } // saving all the data



    dp[1][1] = oszlop[1][1]; // default dp initialization

    backtrack[1][1] = -1; // means it is the end of the road

    for(int i = 2;i<=b;i++ ) {
        dp[1][i] = dp[1][i-1] + oszlop[1][i];
        backtrack[1][i] = 1;
    }

    for(int i = 2;i<=a;i++ ) {
        dp[i][1] = dp[i-1][1] + oszlop[i][1];
        backtrack[i][1] = 0;
    }
    
    // pre initialization 

    // 1 ha balra kulonben 0 ha felfele
    for(int i = 2;i<=a;i++ ) {
        for(int z = 2;z<=b;z++ ) {
            dp[i][z] = min(dp[i-1][z], dp[i][z-1]) + oszlop[i][z];
            if(dp[i-1][z] > dp[i][z-1]) backtrack[i][z] = 1;
            else backtrack[i][z]= 0;
        }
    }


    vector<int> visszafejt;
    vector<int> ans;
    int x = a, y = b;
    priority_queue<int> elemek;
    int sum = 0;
    while(backtrack[x][y] != -1) {
        elemek.push(oszlop[x][y]);
        ans.push_back(oszlop[x][y]);
        if(backtrack[x][y] == 0) {
            x--;
        } else {
            y--;
        }
    }
    ans.push_back(oszlop[1][1]);
    elemek.push(oszlop[1][1]);


    
    //cout << dp[a][b] << endl;
    long long ansf= dp[a][b];
    for(int i = 0;i < c;i++ ) {
        int temp = elemek.top();
        ansf-= temp - temp/2;
        temp/=2;
        elemek.pop();
        elemek.push(temp);
    }
    // for(int i = 0;i < c;i++ ) {
    //     sort(ans.begin(), ans.end());
    //     long long temp = ans[ans.size()-1]/2;
    //     ansf -= ans[ans.size()-1] - temp;
    //     ans[ans.size()-1]/=2;
    // }
    cout << ansf << endl;
    return 0;
}