// Source: https://usaco.guide/general/io

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

#define int long long

const int inf=1e9;

int power(int a,int b){
    if(b==0)return 1;
    return power(a,b-1)*a;
}

signed main() {
    int n,m,mk;cin>>n>>m>>mk;
    vector<vector<int>> v(n+1,vector<int>(m+1));
    vector<vector<vector<int>>> dp(n+1,vector<vector<int>>(m+1,vector<int>(mk+1,inf)));
    for(int i = 1;i<=n;i++){
        for(int j = 1;j<=m;j++){
            cin>>v[i][j];
            dp[i][j][0]=v[i][j];
        }
    }//k=0
    for(int i = 1;i<=n;i++){
        for(int j = 1;j<=m;j++){
            if(i>1&&j>1)
                dp[i][j][0]+=min(dp[i-1][j][0],dp[i][j-1][0]);
            else if(i==1&&j==1)continue;
            else if(i==1)dp[i][j][0]+=dp[i][j-1][0];
            else dp[i][j][0]+=dp[i-1][j][0];
        }
    }
    //k nem nulla de i vagy j 1
    for(int i = 1; i<=n;i++){
        for(int j = 1;j<=m;j++){
            for(int k = 1;k<=mk;k++){
                for(int k2=0;k2<=k;k2++){
                    if(!(i==1||j==1))continue;
                    if(i==1&&j==1)dp[i][j][k]=v[i][j]/power(2,k);
                    else if(i==1)dp[i][j][k]=min(dp[i][j][k],dp[i][j-1][k-k2]+v[i][j]/power(2,k2));
                    else dp[i][j][k]=min(dp[i][j][k],dp[i-1][j][k-k2]+v[i][j]/power(2,k2));    
                }
            }
        }
    }//altalanos keplet
    for(int i = 2; i<=n;i++){
        for(int j = 2;j<=m;j++){
            for(int k = 1;k<=mk;k++){
                for(int k2=0;k2<=k;k2++){
                    dp[i][j][k]=min({dp[i][j][k],dp[i][j-1][k-k2]+v[i][j]/power(2,k2),+dp[i-1][j][k-k2]+v[i][j]/power(2,k2)});
                }
            }
        }
    }/*debug kiiras
    for(int k=0;k<=mk;k++){
        cerr<<"ha k= "<<k<<endl;
        for(int i = 1;i<=n;i++){
            for(int j = 1;j<=m;j++){
                cerr<<dp[i][j][k]<<' ';
            }cerr<<endl;
        }cerr<<endl<<endl;
    }*/
    cout<<dp[n][m][mk]<<endl;    
}