#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
#define Pool(i, m, n) for (ll i = n; i >= m; i--)
#define mod 1000000007ll
//#define mod 998244353ll
#define flagcount __builtin_popcount
#define flag(x) (1 << x)
#define flagadd(bit, x) bit |= flag(x)
#define flagpop(bit, x) bit &= ~flag(x)
#define flagon(bit, i) bit &flag(i)
#define flagoff(bit, i) !(bit & (1 << i))
#define all(v) v.begin(), v.end()
#define low2way(v, x) lower_bound(all(v), x)
#define high2way(v, x) upper_bound(all(v), x)
#define idx_lower(v, x) (distance(v.begin(), low2way(v, x)))  //配列vでx未満の要素数を返す
#define idx_upper(v, x) (distance(v.begin(), high2way(v, x))) //配列vでx以下の要素数を返す
#define idx_lower2(v, x) (v.size() - idx_lower(v, x))         //配列vでx以上の要素数を返す
#define idx_upper2(v, x) (v.size() - idx_upper(v, x))         //配列vでxより大きい要素の数を返す
#define putout(a) cout << a << endl
#define Gput(a, b) G[a].push_back(b)
#define Sum(v) accumulate(all(v), 0ll)
#define gcd(x, y) __gcd(x, y)
ll ctoi(char c)
{
    if (c >= '0' && c <= '9')
    {
        return c - '0';
    }
    return 0;
}
template <typename T>
T lcm(T x, T y)
{
    T z = gcd(x, y);
    return x * y / z;
}
template <typename T>
bool primejudge(T n)
{
    if (n < 2)
        return false;
    else if (n == 2)
        return true;
    else if (n % 2 == 0)
        return false;
    double sqrtn = sqrt(n);
    for (T i = 3; i < sqrtn + 1; i++)
    {
        if (n % i == 0)
        {
            return false;
        }
        i++;
    }
    return true;
}
//場合によって使い分ける
//const ll dx[4]={1,0,-1,0};
//const ll dy[4]={0,1,0,-1};
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
//2次元配列の宣言
//vector<vector<ll>> field(h, vector<ll>(w));

int main()
{
    cout << fixed << setprecision(30);
    ll H, W, K;
    cin >> H >> W >> K;
    vector<string> field(H);
    loop(i, H) cin >> field[i];
    if (H == 1)
    {
        ll zc = 0;
        loop(i, W) if (field[0][i] == '1') zc++;
        putout(zc / K);
        return 0;
    }
    ll ans = 1e9;
    loop(bit, 1 << (H - 1))
    {
        ll divcount = 0;
        vector<pair<ll, ll>> section; //横線に沿って割ったチョコレートの[l,r](l,r=0,1,...H)の区間の組の集合
        ll l = 0;
        loop(r, H - 1)
        {
            if (flagon(bit, r))
            {
                divcount++;
                section.push_back(make_pair(l, r));
                l = r + 1;
            }
        }
        section.push_back(make_pair(l, H - 1));
        ll siz = section.size();
        bool out = false;
        vector<ll> wc(siz); //現在の各チョコレート中のホワイトチョコレートの個数(分断したらリセット)
        loop(i, W)
        {
            //縦方向にwcを加算していく
            loop(j, siz)
            {
                ll L = section[j].first, R = section[j].second;
                Loop(k, L, R + 1)
                {
                    if (field[k][i] == '1')
                        wc[j]++;
                }
            }
            //wcのうち1つでもKを超えていたら分断
            bool check = false;
            loop(i, siz) if (wc[i] > K) check = true;
            if (check)
            {
                divcount++;
                loop(i, siz) wc[i] = 0;
                loop(j, siz)
                {
                    ll L = section[j].first, R = section[j].second;
                    Loop(k, L, R + 1)
                    {
                        if (field[k][i] == '1')
                            wc[j]++;
                    }
                }
                //ここですでにwcがKを超えていたら今回は断念
                loop(i, siz) if (wc[i] > K) out = true;
            }
        }
        if (out)
            continue;
        ans = min(ans, divcount);
    }
    putout(ans);
    return 0;
}


Measured memory_bytes: 3632