#include <bits/stdc++.h>
using namespace std;
using ll=long long; 
int mx=INT_MAX;
int main() {
	int n,m,k;
	cin>>n>>m>>k;
	vector<ll> g[n+1];
	for (int i=0;i<n;i++){
		for (int j=0; j<m;j++){
			int x;
			cin>>x;
			g[i].push_back(x);
		}
	}
	vector<vector<vector<ll>>> dp;
	dp.assign(n+1, vector<vector<ll>> (m+1, vector<ll>(k+1, mx)));
	ll cnt=g[0][0]; 
	for (int i=0; i<=k;i++){
		dp[0][0][i]=cnt;
		cnt=cnt/2;
	} 
	cout<<endl; 
	for (int i=0; i<n;i++){
		for (int j=0; j<m;j++){
				for (int z=0; z<=k;z++){
					if (i-1>=0){
						ll cnt=g[i][j]; 
						for (int p=0;p<=z;p++){					
					
							dp[i][j][z]=min(dp[i-1][j][z-p]+cnt,dp[i][j][z]);
							cnt=cnt/2; 
						}
					}
					if (j-1>=0){
					ll cnt=g[i][j]; 
						for (int p=0;p<=z;p++){
							dp[i][j][z]=min(dp[i][j-1][z-p]+cnt, dp[i][j][z]);

							cnt=cnt/2; 
						}
					}
					
					}
				
				
			}
		}
		cout<<dp[n-1][m-1][k];
	}