#include <iostream>
#include <bits/stdc++.h>

using namespace std;

int main()
{
        int sor, oszlop, din;
        cin >> sor >> oszlop >> din;
        vector<vector<int>> asd(sor, vector<int>(oszlop));
        for(int i = 0; i < sor; i++)
        {
            for(int j = 0; j < oszlop; j++)
            {
                cin >> asd[i][j];
            }
        }
        vector<vector<int>> ertek(sor+1, vector<int>(oszlop+1));
        for(int i = 0; i <= sor; i++)
        {
            ertek[oszlop][i] = 999999999;
        }
        for(int i = 0; i <= oszlop; i++)
        {
            ertek[i][sor] = 999999999;
        }

        int valt = oszlop-2;
        ertek[sor-1][oszlop-1] = asd[sor-1][oszlop-1];
        for(int i = sor-1; i >= 0; i--)
        {
            for(int j = valt; j >= 0; j--)
            {
                if(ertek[i][j+1] > ertek[i+1][j]) ertek[i][j] = asd[i][j] + ertek[i+1][j];
                else ertek[i][j] = asd[i][j] + ertek[i][j+1];
            }
            valt = oszlop-1;
        }
        vector<int> s;
        int x = sor-1;
        int y = oszlop-1;
        s.push_back(asd[x][y]);
        while(x != 0 || y != 0)
        {
            if(y == 0) x--;
            else if(x == 0) y--;
            else if(ertek[x][y-1] > ertek[x-1][y]) x--;
            else y--;
            s.push_back(asd[x][y]);
        }
        sort(s.begin(), s.end(), greater<>());
        while(din > 0)
        {
            s[0] = floor(s[0]/2);
            sort(s.begin(),s.end(), greater<>());
            din--;
        }
        int szam = 0;
        for(int i = 0; i < s.size(); i++)
        {

            szam+=s[i];
        }
        cout << szam;

}