Problem: How many stars are there in the sky? A young programmer Polycarpus can't get this question out of his head! He took a photo of the starry sky using his digital camera and now he analyzes the resulting monochrome digital picture. The picture is represented by a rectangular matrix consisting of n lines each containing m characters. A character equals '1', if the corresponding photo pixel is white and '0', if it is black.

Polycarpus thinks that he has found a star on the photo if he finds a white pixel surrounded by four side-neighboring pixels that are also white: 
    
    
      
     1   
    111  
     1   
    

a star on the photo

Polycarpus whats to cut out a rectangular area from the photo and give his mom as a present. This area should contain no less than k stars. The stars can intersect, have shared white pixels on the photo. The boy will cut out the rectangular area so that its borders will be parallel to the sides of the photo and the cuts will go straight between the pixel borders.

Now Polycarpus keeps wondering how many ways there are to cut an area out of the photo so that it met the conditions given above. Help Polycarpus find this number.

Input

The first line of the input data contains three integers n, m and k (1 ≤ n, m ≤ 500;1 ≤ k ≤ nm). Then follow n lines, containing the description of the given photo as a sequence of lines. Each line contains m characters '0' or '1'.

Output

Print the required number of areas on the given photo.

Examples

Input

4 6 2
111000
111100
011011
000111


Output

6


Input

5 5 4
11111
11111
11111
11111
11111


Output

9

Note

We'll number the rows and columns below starting from 1, the coordinates (p, q) will denote a cell in row p, column q.

In the first sample Polycarpus should cut out any area containing a rectangle whose opposite corners lie in cells (1, 1) and (3, 4). Only rectangles with opposite corners in (1, 1) and (x, y), where x ≥ 3 and y ≥ 4 fit the conditions.

In the second sample any rectangle whose each side is no less than four, will do. The possible rectangle sizes are 4 × 4, 4 × 5, 5 × 4 and 5 × 5. Such figures can be cut in 4 ways, 2 ways, 2 ways and 1 way correspondingly.

Please do not use the %lld specificator to read or write 64-bit integers in C++. It is preferred to use cin, cout streams or the %I64d specificator.

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Comparator;

public class ProblemF {
    
    public static int sum(int[][][] s, int fx, int fy, int tx, int ty) {
        return s[0][ty][tx] - s[2][ty][fx] - s[1][fy][tx] + s[3][fy][fx];
    }

    public static void main(String[] args) throws IOException {
        BufferedReader s = new BufferedReader(new InputStreamReader(System.in));
        String[] p = s.readLine().split(" ");
        int n = Integer.valueOf(p[0]);
        int m = Integer.valueOf(p[1]);
        int k = Integer.valueOf(p[2]);
        
        int[][] map = new int[n][m];
        for (int i = 0 ; i < n ; i++) {
            char[] a = s.readLine().toCharArray();
            for (int j = 0 ; j < m ; j++) {
                map[i][j] = a[j] - '0';
            }
        }
        
        int[][][] sum = new int[4][n+2][m+2];
        int[] dx = {1, -1, 0, 0, 0};
        int[] dy = {0, 0, -1, 1, 0};
        
        int[] sdx = {1, 1, -1, -1};
        int[] sdy = {1, -1, 1, -1};
        for (int i = 1 ; i < n-1 ; i++) {
            for (int j = 1 ; j < m-1 ; j++) {
                int star = 0;
                for (int d = 0 ; d < 5 ; d++) {
                    star += map[i+dy[d]][j+dx[d]];
                }
                if (star == 5) {
                    for (int d = 0 ; d < 4 ; d++) {
                        sum[d][i+sdy[d]+1][j+sdx[d]+1] = 1;
                    }
                }
            }
        }
        
        for (int d = 0 ; d < 4 ; d++) {
            for (int i = 0 ; i <= n+1 ; i++) {
                for (int j = 0 ; j <= m ; j++) {
                    sum[d][i][j+1] += sum[d][i][j];
                }
            }
            for (int j = 0 ; j <= m+1 ; j++) {
                for (int i = 0 ; i <= n ; i++) {
                    sum[d][i+1][j] += sum[d][i][j];
                }
            }
        }
        
        
        long ans = 0;
        for (int fx = 0 ; fx < m ; fx++) {
            for (int fy = 0 ; fy < n ; fy++) {
                int ty = fy + 3;
                for (int tx = m ; tx >= fx+3 ; tx--) {
                    if (sum(sum, fx, fy, tx, n) < k) {
                        break;
                    }
                    while (ty <= n && sum(sum, fx, fy, tx, ty) < k) {
                        ty++;
                    }
                    ans += (n + 1 - ty);
                }
            }
        }
        System.out.println(ans);
    }
}