import Control.Monad

binaryAllSearch :: Int -> [[Int]]
binaryAllSearch n
 | n < 0    = [[]]
 | otherwise = [n:binaryElem | binaryElem <- binaryAllSearch (n - 1)] ++ binaryAllSearch (n - 1)

calcRemainBlackBlock :: [Int] -> [Int] -> Int -> Int -> [[Char]] -> Int
calcRemainBlackBlock row column h w sList
 = length [(i,j) | i<-[0..(h-1)],
                   j<-[0..(w-1)],
                   notElem i row,
                   notElem j column,
                   ((sList !! i) !! j) == '#']

main = do
 [h,w,k] <- map read . words <$> getLine
 sList <- replicateM h getLine
 print $ length $ [(row,column) | row<-binaryAllSearch (h-1),
                                  column<-binaryAllSearch (w-1),
                                  (calcRemainBlackBlock row column h w sList) == k]