// clang-format off
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#ifndef bhartiya
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#endif

#define int long long
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef gp_hash_table<int, int> umap;
typedef tree<int, null_type, less<int>, rb_tree_tag,
        tree_order_statistics_node_update> oset;
typedef pair<pii, int> piii;
typedef vector<int> vi;
typedef vector<pii> vii;

#define INF 100000000000ll
#define MOD 998244353
#define EPS 1e-7
#define PI 3.1415926535897932385
// #define PI acos(-1)

#define pb emplace_back
#define bitc __builtin_popcountll
#define mp make_pair
#define ff first
#define ss second
#define all(ar) ar.begin(), ar.end()
#define len(x) (int)x.length()

#define fr(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define rep(i, n) for (int i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define frr(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define foreach(it, ar) for (auto it = ar.begin(); it != ar.end(); it++)
#define fil(ar, val) memset(ar, val, sizeof(ar))  // 0x3f for inf, 0x80 for -INF can also use with pairs

#ifdef bhartiya
template<typename T>
void __p(T a) { cout << a << " "; }
template<typename T>
void __p(std::vector<T> a) { cout << "{ "; for (auto p : a) __p(p); cout << "}"; }
template<typename T, typename F>
void __p(pair<T, F> a) { cout << "{ "; __p(a.first); __p(a.second); cout << "}"; }
template<typename T, typename ...Arg>
void __p(T a1, Arg ...a) { __p(a1); __p(a...); }
template<typename Arg1>
void __f(const char *name, Arg1 &&arg1) {
    cout<<name<<" : ";__p(arg1);cout<<endl;
}
template<typename Arg1, typename ... Args>
void __f(const char *names, Arg1 &&arg1, Args &&... args) {
    int bracket=0,i=0;
    for(; ;i++)
        if(names[i]==','&&bracket==0)
            break;
        else if(names[i]=='(')
            bracket++;
        else if(names[i]==')')
            bracket--;
    const char *comma=names+i;
    cout.write(names,comma-names)<<" : ";
    __p(arg1);
    cout<<"| ";
    __f(comma+1,args...);
}
#define trace(...) cout<<"Line:"<<__LINE__<<" "; __f(#__VA_ARGS__, __VA_ARGS__)
int begtime = clock();
#define end_routine() cout << "\n\nTime elapsed: " << (clock() - begtime)*1000/CLOCKS_PER_SEC << " ms\n\n";
#else
#define endl '\n'
#define trace(...)
#define end_routine()
#endif

mt19937 rng32(chrono::steady_clock::now().time_since_epoch().count());
inline bool equals(double a, double b) { return fabs(a - b) < 1e-9; }
ll modpow(ll b, ll e, ll mod=MOD) {
    ll ans=1; for(;e;b=b*b%mod,e/=2) if(e&1) ans=ans*b%mod; return ans; }

ll mat[15][1005];
ll n,m,k;
ll now[15];
ll cnt[15];
ll c[15];
void solve() 
{
    cin>>n>>m>>k;
    rep(i,n)
    {
        rep(j,m)
        {
            char ch;
            cin>>ch;
            if(ch=='1')
            {
                mat[i][j]=1;
            }
        }
    }
    if(n==1)
    {
        ll x=0;
        ll ans=0;
        rep(i,m)
        {
            if(mat[0][i]==1)
            {
                x++;
            }
            if(x>k)
            {
                x=1;
                ans++;
            }
        }
        cout<<ans<<endl;
    }
    else
    {
        ll ans=INF;
        rep(i,(1<<(n-1)))
        {
            ll x=1;
            ll cur=0;
            ll an=0;
            rep(j,n-1)
            {
                if((1<<j)&i)
                {
                    for(ll j=cur;j<cur+x;j++)
                    {
                        now[j]=an;
                    }
                    an++;
                    cur=cur+x;
                    x=0;
                }
                x++;
            }
            for(ll j=cur;j<n;j++)
            {
                now[j]=an;
            }
            rep(i,15)
            {
                cnt[i]=0;
                c[i]=0;
            }
            an=bitc(i);
            rep(j,m)
            {
                rep(i,n)
                {
                    if(mat[i][j]==1)
                    {
                        c[now[i]]++;
                    }
                    if(c[now[i]]>k)
                    {
                        an=INF;
                        break;
                    }
                }
                ll han=0;
                rep(i,15)
                {
                    if(cnt[i]+c[i]>k)
                    {
                        han=1;
                    }
                }
                if(han)
                {
                    an++;
                    rep(i,15)
                    {
                        cnt[i]=c[i];
                    c[i]=0;
                    }
                }
                else
                {
                    rep(i,15)
                    {
                        cnt[i]+=c[i];
                    c[i]=0;
                    }
                }
            }
            ans=min(ans,an);
        }
        cout<<ans<<endl;
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0), cout.tie(0), cout.precision(15);   //cout<<fixed;
#ifdef bhartiya
    cin.exceptions(cin.failbit);
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    int t=1;
    // cin>>t;
    fr(i,1,t)
    {
        solve();
    }
    end_routine();
}

Measured memory_bytes: 384