Tontti

#C - tontit

import math

raaka = raw_input().split()

n = int(raaka[0])
m = int(raaka[1])
x = int(raaka[2])

forest = []

for _ in range(n):
    forest.append(raw_input())


def tonttivalinnat(hp, forest):
    paikat = 0
    if n <= m:
        max_a = n
    else:
        max_a = m
    min_a = int(math.ceil(math.sqrt(hp)))
    for size in range(min_a, max_a):
        #j on tutkittavan nelion koko (j2)
        for yaxis in range(n - (size - 1)):
            #k on nelioiden maara pystyrivilla
            for xaxis in range(m - (size - 1)):
                #l on tarvittavien vaihdosten maara
                #nyt "koordinaatit" on maaritelty
                tpuut = 0
                for y in range(size):
                    for x in range(size):
                        if forest[yaxis + y][xaxis + x] == '*':
                            tpuut += 1
                if tpuut == hp:
                    paikat += 1
                            
    return paikat

print tonttivalinnat(x, forest)
                       
    
    
    

    

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED