#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define pli pair<ll, int>
#define pil pair<int, ll>
#define pll pair<ll, ll>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define endl '\n'
const int inf = 1000000007;
const ll INF = 1e18;
// int mod = 998244353;
int mod = 1000000007;
const double eps = 1e-8;
#define abs(x) (x >= 0 ? x : -(x))
#define lb(v, x) (int)(lower_bound(all(v), x) - v.begin())
#define ub(v, x) (int)(upper_bound(all(v), x) - v.begin())
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return 1; } return 0; }
ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template<typename T, typename U> T pow_(T a, U b) { return b ? pow_(a * a, b / 2) * (b % 2 ? a : 1) : 1; }
ll modpow(ll a, ll b, ll _mod) { return b ? modpow(a * a % _mod, b / 2, _mod) * (b % 2 ? a : 1) % _mod : 1; }
template<class T, class U> ostream& operator << (ostream& os, const pair<T, U>& p) { os << p.F << " " << p.S; return os; }
template<class T> ostream& operator << (ostream& os, const vector<T>& vec) { rep(i, sz(vec)) { if (i) os << " "; os << vec[i]; } return os; }
template<class T> ostream& operator << (ostream& os, const set<T>& s) { for (auto si : s) os << si << " "; return os; }
template<typename T> inline istream& operator >> (istream& is, vector<T>& v) { rep(j, sz(v)) is >> v[j]; return is; }
template<class T, class T2> inline void add(T &a, T2 b) { (a += (b % mod + mod)) %= mod; }
template<class T> void operator += (vector<T>& v, vector<T> v2) { rep(i, sz(v2)) v.eb(v2[i]); }

void solve();

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cout << fixed << setprecision(12);
    int T;
    T = 1;
    while (T--) solve();
}

// https://atcoder.jp/contests/abc159/submissions/16661765
void solve() {
    int h, w, k_;
    cin >> h >> w >> k_;
    vector<vector<int> > a(h, vector<int>(w));
    rep(i, h) rep(j, w) { char c; cin >> c; a[i][j] = c - '0'; }
    
    // 縦を全探索, 横は貪欲で決まる
    int ans = inf;
    rep(i, 1 << (h - 1)) { // i番目のブロックの下に区切りを入れる
        int x = __builtin_popcount(i);
        vector<int> cnt(x + 1);
        int tmp = x;
        
        set<int> s;
        rep(j, w) {
            int flg = 0;
            int now = 0; // debuged, rep(j, の中
            rep(k, h) {
                if (k && (i & 1 << (k - 1))) ++now;
                cnt[now] += a[k][j];
                if (cnt[now] > k_) {
                    flg = 1;
                    break;
                }
            }
            if (flg) {
                if (s.count(j)) { // このiでは無理
                    break;
                }
                rep(k, x + 1) cnt[k] = 0;
                ++tmp;
                s.emplace(j);
                --j; // debuged, s.emplaceの後!!
            }
            if (j == w - 1) {
                chmin(ans, tmp);
            }
        }
    }
    cout << ans << endl;
}




Measured memory_bytes: 3644