import java.util.ArrayList;
public class Main {
private static int hits;
public static void main(String[] args) {
IO io = new IO();
int height = io.nextInt();
int width = io.nextInt();
int trees = io.nextInt();
hits = 0;
ArrayList<String> woods = new ArrayList<>();
for (int i = 0; i < height; i++) {
woods.add(io.next());
}
int smallest = height;
if (height > width) {
smallest = width;
}
iterateThroughAllSquares(width, height, smallest, woods, trees);
io.println(hits);
io.close();
}
private static void searchSquare(int startx, int starty, int size, ArrayList<String> woods, int trees) {
int temphits = 0;
/* for (int j = starty; j < f1; j++) {
for (int i = startx; i < f2; i++) {
System.out.print(woods.get(j).charAt(i));
if (woods.get(j).charAt(i) == '*') {
temphits++;
}
}
System.out.println("");
}
System.out.println("------------");
if (temphits == trees) {
hits++;
}
size--;
if (temphits >= trees && size*size >= trees) {
}
size--;
if (temphits >= trees && size*size >= trees) {
for (int i = 0; i <= woods.size()-size-starty; i++) {
searchSquare(startx, starty+i, size, woods, trees);
}
}*/
int foundTrees = 0;
for (int i = 1; i <= size; i++) {
if(foundTrees<=trees) {
foundTrees = checkSquare(startx,starty,i,woods,trees,foundTrees);
} else {
break;
}
}
//skip the check of unrealistically small squares, if needed
//in this function, the grid starts from 0,0 in the left upper corner
/*private static void iterate2(int width, int height, int size, ArrayList<String> woods, int trees) {
/* int temphits = 0;
for (int i = height; i <= woods.size()-size; i++) {
}*/
}
private static int checkSquare(int startx, int starty, int size, ArrayList<String> woods, int trees, int foundTrees) {
for (int i = 0; i < size-1; i++) {
if (woods.get(size-1+starty).charAt(i)=='*') {
foundTrees++;
}
}
for (int i = 0; i < size; i++) {
if (woods.get(i+startx).charAt(size-1)=='*') {
foundTrees++;
}
}
if (foundTrees==trees) {
hits++;
}
return foundTrees;
}
private static void iterateThroughAllSquares(int width, int height, int size, ArrayList<String> woods, int trees) {
for (int i = 0; i <= width-size; i++) {
for (int j = 0; j <= height-size; j++) {
if (width<height) {
int tmp = size - i;
} else {
int tmp = size - j;
}
searchSquare(i,j,tmp,woods,trees);
System.out.println(j);
}
}
/*for (int i = 0; i <= width - size; i++) {
for (int j = 0; j <= height - size; j++) {
int temphits = searchSquare(i, j, size, woods, trees);
if (height < width) {
iterate2(i,0,size-1,woods,trees);
}
}
}*/
//if higher than wider: diff function. Iterate through only the top or left side of the square and only if there
//are enough potential trees
// no need for if??, just stick them in different parts of the for loop
/*size--;
if (Math.pow(size, 2) >= trees) {
iterateThroughAllSquares(width, height, size, woods, trees);
}*/
}
}
