Problem:
Score : 500 points

Problem Statement

We have a chocolate bar partitioned into H horizontal rows and W vertical columns of squares.

The square (i, j) at the i-th row from the top and the j-th column from the left is dark if S_{i,j} is 0, and white if S_{i,j} is 1.

We will cut the bar some number of times to divide it into some number of blocks. In each cut, we cut the whole bar by a line running along some boundaries of squares from end to end of the bar.

How many times do we need to cut the bar so that every block after the cuts has K or less white squares?

Constraints

1 \leq H \leq 10

1 \leq W \leq 1000

1 \leq K \leq H \times W

S_{i,j} is 0 or 1.

Input

Input is given from Standard Input in the following format:

H W K
S_{1,1}S_{1,2}...S_{1,W}
:
S_{H,1}S_{H,2}...S_{H,W}

Output

Print the number of minimum times the bar needs to be cut so that every block after the cuts has K or less white squares.

Sample Input 1

3 5 4
11100
10001
00111

Sample Output 1

2

For example, cutting between the 1-st and 2-nd rows and between the 3-rd and 4-th columns - as shown in the figure to the left - works.

Note that we cannot cut the bar in the ways shown in the two figures to the right.

Sample Input 2

3 5 8
11100
10001
00111

Sample Output 2

0

No cut is needed.

Sample Input 3

4 10 4
1110010010
1000101110
0011101001
1101000111

Sample Output 3

3

Solution in Ruby (2.3.3) (judge verdict: Time Limit Exceeded)

h, w, k = gets.split.map(&:to_i)
INF = h * w

arr = []
h.times do
  arr << gets.chars
end

range_set = (0..2**(h-1)-1).map do |t|
  ts = t.to_s(2).rjust(h-1, '0').chars.map(&:to_i)
  tt = [0]
  ts.each_with_index { |s, idx| tt[idx+1] = tt[idx] + s }
  start = 0
  ranges = []
  10.times do |i|
    len = tt.count(i)
    break if len.zero?

    ranges << (start..(start+len-1))
    start += len
  end
  ranges
  # H方向のビットパターンをrangeで生成
end

min_cost = INF

range_set.each do |rs|
  left = 0
  cost = rs.size - 1
  w.times do |right|
    tf = rs.all? do |r|
      arr[r].map{|warr| warr[left..right].count('1')}.inject(:+) <= k
    end
    next if tf
    break cost = INF if left == right

    left = right
    cost += 1
  end
  min_cost = [min_cost, cost].min
end
p min_cost