#include <iostream>
//#include <fstream>
#include <algorithm>
#include <vector>

using namespace std;

//ifstream cin("dinamit.in");
//ofstream cout ("dinamit.out");
struct adat
{
    long long irany,k; //k=kenyelmetlenseg
};
adat x[101][101];
long long t[101][101],i,j,n,m,k,a,b,c,d,db,s,p,maxi;
vector<int>y;
int main()
{
    cin>>n>>m>>k;
    for(i=1;i<=n;++i)
    {
        for(j=1;j<=m;++j)
        {
            cin>>t[i][j];
        }
    }


   for(i=1;i<=n;++i)
    {
        for(j=1;j<=m;++j)
        {
            if(i==1)
            {
                x[i][j].irany=0;
                x[i][j].k=x[i][j-1].k+t[i][j];
            }
            else
                if(j==1)
                {
                    x[i][j].irany=1;
                    x[i][j].k=x[i-1][j].k+t[i][j];
                }
            else
            {
                c=t[i][j]+x[i][j-1].k;
                d=t[i][j]+x[i-1][j].k;
                if(c<d)
                {
                    x[i][j].k=c;
                    x[i][j].irany=0;
                }
                else
                {
                    x[i][j].k=d;
                    x[i][j].irany=1;
                }
            }
        }
    }

i=n;
j=m;
    while(i!=0 && j!=0)
    {
        y.push_back(t[i][j]);

        if(x[i][j].irany==0)j--;
        else i--;
    }
//----------------------------------------

    for(i=0;i<k;++i)
    {
        maxi=-1;
        p=0;
        for(j=0;j<y.size();++j)
            if(y[j]>maxi)
        {
            maxi=y[j];
            p=j;
        }
        y[p]=y[p]/2;
    }
    s=0;
    for(i=0;i<y.size();++i)
    {
        s+=y[i];
    }
    cout<<s;

    return 0;
}