#include <iostream>
#include <queue>

using namespace std;

priority_queue <long long> v;
long long i, n, j, m, bomb, sum[41][41], num[41][41], osszeg, a;

int main()
{
    cin>>n>>m>>bomb;

    for (i=1; i<=n; ++i)
    {
        for (j=1; j<=m; ++j)
        {
            cin>>num[i][j];

            if (i==1) sum[i][j]=sum[i][j-1]+num[i][j];
            else if (j==1) sum[i][j]=sum[i-1][j]+num[i][j];
            else sum[i][j]=min(sum[i-1][j],sum[i][j-1])+num[i][j];
        }
    }

    i=n;
    j=m;
    while (sum[i][j]>0)
    {
        v.push(num[i][j]);

        if (sum[i-1][j]<sum[i][j-1] || j==1) --i;
        else --j;
    }

    for (i=1; i<=bomb; ++i)
    {
        a=v.top()/2;
        v.pop();
        v.push(a);
    }

    while (!v.empty())
    {
        osszeg+=v.top();
        v.pop();
    }

    cout<<osszeg;

    return 0;
}