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

int main() {
	int n,m,rob; cin >> n >> m >> rob;
    vector <vector <int>> v(n+1,vector <int> (m+1));
    vector <vector <vector <int>>> dp(n+1,vector <vector <int>> (m+1,vector <int> (rob+1, 1e9)));
    for(int i = 1;i <= n; i++){
        for(int j = 1; j <= n; j++){
            cin >> v[i][j];
        }
    }
    /*for(int i = 0;i <= n; i++){
        for(int j = 0; j <= n; j++){
            for(int l = 0; l <= k; l++){
                dp[i][j][l] = INT_MAX;
            }
        }
    }*/
    int x = 0;
    for(int k = 0; k <= rob; k++){
        for(int i = 1;i <= n; i++){
            for(int j = 1; j <= n; j++){
                x = v[i][j];
                for(int l = 0; l <= k; l++){
                    if(i == 1 && j == 1){
                        dp[i][j][k] = x;
                    }else{
                        dp[i][j][k] = min(dp[i][j][k],min(dp[i-1][j][k-l],dp[i][j-1][k-l]) + x);
                    }
                    x >>= 1;
                }
            }
        }
    }
    

    cout << dp[n][m][rob];

    
}