#include <iostream>
#include <vector>
#include <algorithm>
#include <climits>
#include <cmath>
#define ll long long 

using namespace std;

ll n, m, i, j, k, l, p, o;

int main()
{
    cin >> n >> m >> k;
 
    vector <vector<ll> > terkep(n+1, vector<ll>(m+1, INT_MAX));
    for (i = 1; i <= n; ++ i)
    {
        for (j = 1; j <= m; ++j) cin >> terkep[i][j];
    }

    vector <vector<vector<ll> > > mini(n + 1, vector<vector<ll> >(m + 1, vector<ll>(k + 1, INT_MAX)));
    ll actut = 0;
    mini[1][0][0] = 0;
    for (i = 1; i <= n; ++i)
    {
        for (j = 1; j <= m; ++j)
        {
            for (o = 0; o <= k; ++o)
            {
                for (p = 0; p <= k - o; ++p)
                {
                    actut = min(mini[i - 1][j][o] + terkep[i][j] / pow(2, p), mini[i][j - 1][o] + terkep[i][j] / pow(2, p));
                    mini[i][j][o + p] = min(mini[i][j][o + p], actut);
                }
            }
        }
    }
    cout << mini[n][m][k];
    return 0;

}