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

void printq(priority_queue<ll> q)
{
  cout << "queue: ";
  while(!q.empty()){
    cout << q.top() << " ";
    q.pop();
  }
  cout << "\n";
}

int main() {
	ll n,m,k;
  cin >> n >> m >> k;

  vector<vector<ll> > tabla, dp(n+1, vector<ll>(m, 0));
  priority_queue<ll> mo;

  for(int i = 0; i < n; i++) {
    vector<ll> v;
    for(int j = 0; j < m; j++) {
      ll x;
      cin >> x;
      v.push_back(x);
    }
    tabla.push_back(v);
  }

  dp[0][0] = tabla[0][0];

  for(int i = 1; i < n; i++) {
    dp[i][0] = tabla[i][0] + dp[i-1][0];
  }
  for(int i = 1; i < m; i++) {
    dp[0][i] = tabla[0][i] + dp[0][i-1];
  }

  for(int i = 1; i < n; i++) {
    for(int j = 1; j < m; j++) {
      dp[i][j] = min(dp[i-1][j], dp[i][j-1]) + tabla[i][j];
    }
  }

  /*cout << "dp: " << "\n";
  for(int i = 0; i < n; i++) {
    for(int j = 0; j < m; j++) {
      cout << dp[i][j] << " ";
    }
    cout << "\n";
  }*/

  ll i = n-1, j = m-1;
  while(i > 0 || j > 0)
  {
    //cout << "i: " << i << " j: " << j << " \n";
    mo.push(tabla[i][j]);
    if(i == 0) {
      j--;
    }
    else if(j == 0) {
      i--;
    }
    else {
      if(dp[i-1][j] < dp[i][j-1]) {
        i--;
      }
      else {
        j--;
      }
    }
  }
  mo.push(tabla[i][j]);

  //printq(mo);
  while(k--) {
    ll curr = mo.top();
    mo.pop();

    mo.push(curr/2);
  }
  //printq(mo);

  ll ki = 0;
  while(!mo.empty())
  {
    ki += mo.top();
    mo.pop();
  }
  cout << ki << "\n";
	return 0;
}