Problem:
 Score : 300 points    Problem Statement We have a grid of H rows and W columns of squares. The color of the square at the i -th row from the top and the j -th column from the left (1 \leq i \leq H, 1 \leq j \leq W) is given to you as a character c_{i,j} : the square is white if c_{i,j} is . , and black if c_{i,j} is # .  Consider doing the following operation:   Choose some number of rows (possibly zero), and some number of columns (possibly zero). Then, paint red all squares in the chosen rows and all squares in the chosen columns.   You are given a positive integer K . How many choices of rows and columns result in exactly K black squares remaining after the operation? Here, we consider two choices different when there is a row or column chosen in only one of those choices.      Constraints  1 \leq H, W \leq 6  1 \leq K \leq HW  c_{i,j} is . or # .         Input Input is given from Standard Input in the following format:  H  W  K  c_{1,1}c_{1,2}...c_{1,W}  c_{2,1}c_{2,2}...c_{2,W}  :  c_{H,1}c_{H,2}...c_{H,W}       Output Print an integer representing the number of choices of rows and columns satisfying the condition.        Sample Input 1 2 3 2
..#
###      Sample Output 1 5  Five choices below satisfy the condition.   The 1 -st row and 1 -st column  The 1 -st row and 2 -nd column  The 1 -st row and 3 -rd column  The 1 -st and 2 -nd column  The 3 -rd column        Sample Input 2 2 3 4
..#
###      Sample Output 2 1  One choice, which is choosing nothing, satisfies the condition.       Sample Input 3 2 2 3
##
##      Sample Output 3 0       Sample Input 4 6 6 8
..##..
.#..#.
#....#
######
#....#
#....#      Sample Output 4 208

Solution (Python):
def main(sample_file = ''):

    """ convenient functions
    
    
    
    
    
    """

    """convenient decorator
    
    
        
        
        
        
        
        
        
        
        
        
    """
    
    
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product, combinations_with_replacement 
    
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  
        b, e = 2, 0  
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):   
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict 
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest 
    from copy import deepcopy, copy 
    import operator
    from operator import itemgetter 
    
    
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd
    def gcd(a,b):
        
        
        if a<b:
            a, b = b, a
        while a%b !=0 :
            a, b = b, a%b
        return b

    
    
    
    
    
    

    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)

    
    def sieve_of_eratosthenes(end, typecode="L"):
        
        

        
        import array
        import textwrap
        assert end > 1
        
        
        
        is_prime = array.array("B", (True for i in range(end)))
        
        is_prime[0] = False
        is_prime[1] = False
        
        primes = array.array(typecode)
        
        for i in range(2, end):
            if is_prime[i]:
                primes.append(i)
                for j in range(2 * i, end, i):
                    is_prime[j] = False  
        return primes

    class PrimeFactorization:
        '''初期化にO(NloglogN)/ 因数分解クエリをO(log(k))/ 素数判定クエリをO(1)
        >>> pf = PrimeFactorization(100)
        >>> pf.query(100)
        ((2, 2), (5, 2))
        
        '''
        
        
        
        
        
        
        
        def __init__(self, Num=10**6):
            from collections import defaultdict
            from math import floor
            self.Num = Num
            self.D = [-1] * (Num+1)
            for i in range(2, Num+1):
                if self.D[i] != -1:
                    continue
                self.D[i] = i
                for j in range(1, floor(Num/i)+1):
                    if self.D[j*i] != -1:
                        continue
                    else:
                        self.D[j*i] = i
        
        def query(self, k):
            ans = defaultdict(int)
            tmp = k
            while self.D[tmp] != -1:
                div = self.D[tmp]
                ans[div] += 1
                tmp = tmp//div
            return tuple(ans.items())
        
        def is_prime(self, k):
            return k == self.D[k]

    
    
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    AtoZ = list('abcdefghijklmnopqrstuvwxyz') 
    modpow = lambda a, n, p = MOD: pow(a, n, p) 
    def modinv(a, p = MOD):
        
        
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        
        
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something like:
        >>      pass
        >>  else:
        >>      do something like:
        >>      L[find_root(a)] = L[find_root(a)] + L[find_root(b)]
        >>      L[find_root(b)] = L[find_root(a)]
        >>      
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    
    
    
    class SegTree:
        """
        ref: https://qiita.com/takayg1/items/c811bd07c21923d7ec69
        init(init_val, ide_ele): 配列init_valで初期化 O(N)
        update(k, x): k番目の値をxに更新 O(logN)
        query(l, r): 区間[l, r)をsegfuncしたものを返す O(logN)
        
        ex: seg = SegTree([14, 5, 9, 13], min, float('inf'))
        """
        def __init__(self, init_val, segfunc, ide_ele):
            """
            init_val: 配列の初期値
            segfunc: 区間にしたい操作
            ide_ele: 単位元
            n: 要素数
            num: n以上の最小の2のべき乗
            tree: セグメント木(1-index)
            """
            n = len(init_val)
            self.segfunc = segfunc
            self.ide_ele = ide_ele
            self.num = 1 << (n - 1).bit_length()
            self.tree = [ide_ele] * 2 * self.num
            
            for i in range(n):
                self.tree[self.num + i] = init_val[i]
            
            for i in range(self.num - 1, 0, -1):
                self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])

        def update(self, k, x):
            """
            k番目の値をxに更新
            k: index(0-index)
            x: update value
            """
            k += self.num
            self.tree[k] = x
            while k > 1:
                self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])
                k >>= 1

        def query(self, l, r):
            """
            [l, r)のsegfuncしたものを得る
            l: index(0-index)
            r: index(0-index)
            """
            res = self.ide_ele
            l += self.num
            r += self.num
            while l < r:
                if l & 1:
                    res = self.segfunc(res, self.tree[l])
                    l += 1
                if r & 1:
                    res = self.segfunc(res, self.tree[r - 1])
                l >>= 1
                r >>= 1
            return res

    
    
    
    
    
    
    
    

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    
    def warshall_floyd(number_vertex, XYD, shift_one_for_vertex=False):
        
        
        
        
        
        d = [[float("inf")]*number_vertex for i in range(number_vertex)]
        for x, y, dist in XYD:
            if shift_one_for_vertex:
                x = x - 1
                y = y - 1
            d[x][y] = dist
            d[y][x] = dist
        for i in range(number_vertex):
            d[i][i] = 0 
        for k in range(number_vertex):
            for i in range(number_vertex):
                for j in range(number_vertex):
                    d[i][j] = min(d[i][j],d[i][k] + d[k][j])
        return d


    """ initialize variables and set inputs
    
        
        
            
            
    
        
        
        
        
        
        
        
    
        
        
        
        
    
        
        
    """

    
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    r_float = lambda: float(r())
    R = lambda: list(map(int, r().split()))
    R_str = lambda: r().split()
    R_map = lambda: map(int, r().split())
    R_float = lambda: list(map(float, r().split()))
    R_tuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    
    
    
    
    
    
    
    """

    
    if sample_file:
        sys.stdin = open(sample_file)
        
    
    
    
    H, W, K = R()
    C = [R_str() for _ in range(H)]
    D = [[0]*W for _ in range(H)]
    for i in range(H):
        for j in range(W):
            if C[i][0][j] == '
                D[i][j] = 1
    ans = 0
    for h in range(2**H):
        for w in range(2**W):
            binh = bin(h)[-1:1:-1]
            binw = bin(w)[-1:1:-1]
            E = deepcopy(D)
            for i, hh in enumerate(binh):
                if int(hh):
                    for ww in range(W):
                        E[i][ww] = '.'
            for i, ww in enumerate(binw):
                if int(ww):
                    for hh in range(H):
                        E[hh][i] = '.'
            tmp = sum(a.count(1) for a in E)
            if tmp == K:
                ans += 1
    print(ans)
    
    
    
    

    """memo: how to use defaultdict of list
    
    Dic = defaultdict(list)
    
    Dic[x].append(y)
    
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    
    >>> a = 5
    >>> bin_str_a = format(a, '
    >>> print(bin_str_a)
    0b0101 
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Solution (Python):
h, w, k = map(int, input().split())
board = [[-1 for j in range(w)] for i in range(h)]
for i in range(h):
    color = input()
    for j in range(w):
        if color[j] == "
            board[i][j] = 1 
        else:
            board[i][j] = 0 
ans = 0

for row_choose in range(1<<h):
    for col_choose in range(1<<w):
        count = 0
        for i in range(h):
            for j in range(w):
                if not (row_choose & (1<<i)) and not (col_choose & (1<<j)) and board[i][j]:
                    count += 1
        if count == k:
            ans += 1

print(ans)

Solution (Python):
h,w,k=map(int,input().split())
board=[list(input()) for _ in range(h)]
ans=0
for paint_h in range(2**h):
  for paint_w in range(2**w):
    cnt=0
    for i in range(h):
      for j in range(w):
        if (paint_h>>i)&1==0 and (paint_w>>j)&1==0:
          if board[i][j]=='
            cnt+=1
    if cnt==k:
      ans+=1
print(ans)

Solution (Python):
from sys import stdin

input = stdin.readline



def solve():
    Y, X, K = map(int, input().split())
    c = [inp for inp in stdin.read().splitlines()]
    res = 0
    for ymask in range((1<<Y) - 1):
        for xmask in range((1<<X) - 1):
            cnt = 0
            for y in range(Y):
                for x in range(X):
                    if ymask & (1<<y) == 0 and xmask & (1<<x) == 0 and c[y][x] == '
                        cnt += 1
            if cnt == K:
                res +=1
    print(res)



if __name__ == '__main__':
    solve()

Solution (Python):





















import math
import copy
import string



INF = int(10**18) 
pi = math.pi

MOD = 1000000007








def my_pow(N, a, M):
    if(a == 0):
        return 1
    else:
        if(a % 2 == 0):
            tempo = my_pow(N, a/2, M)
            return (tempo * tempo) % M
        else:
            tempo = my_pow(N, a - 1, M)
            return (tempo * N) % M





def my_combination(N, a, M):
    res = 1

    for i in range(0, a):
        res *= N - i
        res %= M

    for i in range(0, a):
        res *= my_pow(i + 1, M - 2, M)
        res %= M

    return res





def my_combination_table(N, M, v):
    if(len(v) < N + 1):
        l = N + 1 - len(v)
        tempo = [1] * l
        v.extend(tempo)

    for i in range(1, N + 1):
        v[i] = v[i - 1] * (N - (i - 1))
        v[i] %= M

        v[i] *= my_pow(i, M - 2, M)
        v[i] %= M

    return










H, W, K = (int(x) for x in input().split())
c = [input() for i in range(0, H)]

res = 0
for i in range(0, 2 ** H):
    for j in range(0, 2 ** W):
        cnt = 0
        for h in range(0, H):
            for w in range(0, W):
                if(c[h][w] == '
        if(cnt == K): res += 1

print(res)

Solution (Python):
H,W,K = map(int, input().split())

c = []
for i in range(H):
    c.append(input())


ans = 0
for paint_h in range(2**H):
    for paint_w in range(2**W):
        cnt = 0
        for i in range(H):
            for j in range(W):
                if(paint_h>>i)&1==0 and (paint_w>>j)&1==0:
                    if c[i][j]=='
                        cnt+=1
        if cnt == K:
            ans += 1
print(ans)

Solution (Python):
H,W,K=map(int,input().split())
S=[list(input()) for _ in range(H)]
ans=0

for H_mask in range(2**H):
  for W_mask in range(2**W):
    cnt=0
    for i in range(H):
      for j in range(W):
        if (H_mask>>i)&1==0 and (W_mask>>j)&1==0\
        and S[i][j]=='
          cnt+=1
    if cnt==K:
      ans+=1

print(ans)

Solution (Python):
from itertools import product

H,W,K=map(int,input().split())
c=[]
ans=0
for i in range(H):
    c.append(input())
for row_bit in product(range(2),repeat=H):
    for col_bit in product(range(2),repeat=W):
        count=0
        
        for row in range(H):
            for col in range(W):
                if c[row][col]=="
                    count+=1
                    
        if count==K:
            ans+=1
print(ans)

Solution (Python):
h, w, k = [int(i) for i in input().split()]
c = [input() for i in range(h)]

cnt = 0
for i in range(1 << h):
    bit_h = [0] * h
    for j in range(h): bit_h[j] = int(i & (1 << j) > 0)
    for j in range(1 << w):
        bit_w = [0] * w
        for l in range(w):
            bit_w[l] = int(j & (1 << l) > 0)
        cnt_t = 0
        for m in range(h):
            for n in range(w):
                if bit_h[m] == 0 and bit_w[n] == 0 and c[m][n] == "
        if cnt_t == k:
            cnt += 1
            

print(cnt)

Solution (Python):
H, W, K = map(int, input().split())
C = [list(input()) for _ in range(H)]

ans = 0
for row in range(2 ** H - 1):
    for col in range(2 ** W - 1):
        count = 0
        for i in range(H):
            for j in range(W):
                if not ((row >> i) & 1) and not ((col >> j) & 1) and C[i][j] == '
                    count += 1
        if count == K:
            ans += 1

print(ans)

Solution (Python):
h, w, k = map(int, input().split())
ccc = [input() for _ in range(h)]
ans = 0
for bit_h in range(2 ** h):
    for bit_w in range(2 ** w):
        cnt = 0
        for i in range(h):
            for j in range(w):
                if (bit_h >> i) & 1 == 0 and (bit_w >> j) & 1 == 0:
                    if ccc[i][j] == '
                        cnt += 1
        if cnt == k:
            ans += 1
print(ans)

Solution (Python):
h, w, k = map(int, input().split())
ccc = [input() for _ in range(h)]
ans = 0
for bit_h in range(2 ** h):
    for bit_w in range(2 ** w):
        cnt = 0
        for hi in range(h):
            for wi in range(w):
                if (bit_h >> hi) & 1 == 0 and (bit_w >> wi) & 1 == 0:
                    if ccc[hi][wi] == '
                        cnt += 1
        if cnt == k:
            ans += 1
print(ans)

Solution (Python):
def main():
    H, W, K = map(int, input().split())
    grid = [input() for _ in range(H)]

    n = H + W
    ans = 0
    for case in range(2**n):
        cnt = 0
        for i in range(H):
            for j in range(W):
                if (case >> i) & 1:
                    if (case >> j + H) & 1:
                        if grid[i][j] == "
                            cnt += 1
        if cnt == K:
            ans += 1
    print(ans)
   
main()

Solution (Python):
H,W,K=map(int,input().split())
c=[input() for _ in range(H)]

ans=0
for i in range(1<<H):
    for j in range(1<<W):
        cnt=0
        for h in range(H):
            for w in range(W):
                if c[h][w]=='
                    if (i>>h)%2==0 and (j>>w)%2==0:
                        cnt+=1
        if cnt==K:
            ans+=1
print(ans)

Solution (Python):
h,w,K =  map(int,input().split())
masu = [input() for _ in range(h)]
ans = 0
for i in range(2**h):
    for j in range(2**w):
        cnt = 0
        for k in range(h):
            for l in range(w):
                if ((i >> k) & 1) and ((j >> l) & 1) and masu[k][l] == "
                    cnt += 1
        if cnt == K:
            ans += 1
 
print(ans)

Solution (Python):
h, w, k = map(int, input().split())
c = [list(input()) for _ in range(h)]
ans = 0
for i in range(1<<h):
    for j in range(1<<w):
        cnt = sum(c[k][l] == '
        if cnt == k:
            ans += 1
print(ans)

Solution (Python):
H, W, K = map(int, input().split())
lis = []
ans = 0
for i in range(H):
  lis.append(list(input()))
for i in range(1<<H):
  for j in range(1<<W):
    cnt = 0
    for p in range(H):
      for q in range(W):
        if (i>>p) & 1:
          continue
        if (j>>q) & 1:
          continue
        if lis[p][q] == "
          cnt += 1
    if cnt == K:
      ans += 1
print(ans)

Solution (Python):
h,w,k=map(int,input().split())
li=[]
for i in range(h):
  li.append(list(input()))
ans=0
for i in range(1<<h):
  for j in range(1<<w):
    cnt=0
    for p in range(h):
      for q in range(w):
        if i>>p&1:
          continue
        if j>>q&1:
          continue
        if li[p][q]=="
          cnt+=1
    if cnt==k:
      ans+=1
print(ans)

Solution (Python):
h,w,k=map(int,input().split())
li=[]
for i in range(h):
  li.append(list(input()))
ans=0
for i in range(1<<h):
  for j in range(1<<w):
    cnt=0
    for p in range(h):
      for q in range(w):
        if i>>p&1:
          continue
        if j>>q&1:
          continue
        if li[p][q]=="
          cnt+=1
    if cnt==k:
      ans+=1
print(ans)

Solution (Python):
from itertools import product

h, w, k = map(int, input().split())
c = [input() for i in range(h)]
ans = 0
 
for maskR in product([0,1], repeat=h):
    for maskC in product([0,1], repeat=w):
        b = 0
        for i in range(h):
            for j in range(w):
                if maskR[i] == 1 and maskC[j] == 1 and c[i][j] == '
                    b += 1
        if b ==k:
            ans += 1
print(ans)

Solution (Python):
H, W, K = map(int, input().split())
S = [input() for _ in range(H)]
ans = 0
for h in range(2**H):
    h = bin(h)[2:].zfill(H)
    for w in range(2**W):
        w = bin(w)[2:].zfill(W)
        cnt = 0
        for i in range(H):
            if h[i] == '1': continue
            for j in range(W):
                if w[j] == '1': continue
                if S[i][j] == '
                    cnt += 1
        
        if cnt == K:
            ans += 1

print(ans)

Solution (Python):
h, w, k, = map(int, input().split())

c = [0] * h
for i in range(h):
    c[i] = input()
    
y = 0
    
for i in range(2 ** (h + w)):
    x = 0
    a = [0] * (h + w)
    for j in range(h + w):
        if (i // (2 ** j)) % 2 == 1:
            a[j] = 1
    
    for j in range(h):
        if a[j] == 0: 
            for l in range(w):
                if a[h+l] == 0:
                    if c[j][l] == '
                        x += 1
    
    if x == k:
        y += 1
        
print(y)

Solution (Python):
from itertools import product

h, w, k = map(int, input().split())
c = [list(input()) for _ in range(h)]

ans = 0

for row_bit in product(range(2), repeat=h):
    for col_bit in product(range(2), repeat=w):
        cnt = 0
        for row in range(h):
            for col in range(w):
                if c[row][col] == '
                    cnt += 1
        if cnt == k:
            ans += 1

print(ans)

Solution (Python):
def main():
    h, w, k = map(int, input().split())
    c = []
    for i in range(h):
        c.append(list(input()))

    ans = 0
    for i in range(2**h):
        for j in range(2**w):
            count = 0
            for ii in range(h):
                for jj in range(w):
                    if not (i >> ii & 1 or j >> jj & 1) and c[ii][jj] == "
                        count += 1
            if count == k:
                ans += 1

    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):
import itertools


def main():
    
    h, w, k = map(int, input().split())
    
    
    c = []
    for i in range(h):
        c.append(list(input()))

    total = 0
    for i in list(itertools.chain.from_iterable(c)):
        if i == "
            total += 1

    ans = 0
    for i in range(2**h):
        for j in range(2**w):
            count = 0
            for ii in range(h):
                for jj in range(w):
                    if (i >> ii & 1 or j >> jj & 1) and c[ii][jj] == "
                        count += 1
            if total - count == k:
                ans += 1

    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):
from itertools import product
h, w, k = map(int, input().split())
c = [input() for i in range(h)]
ans = 0

for maskR in product([0,1], repeat=h):
    for maskC in product([0,1], repeat=w):
        b = 0
        for i in range(h):
            for j in range(w):
                if maskR[i]==1 and maskC[j]==1 and c[i][j]=="
                    b += 1
        if b == k:
            ans += 1
print(ans)

Solution (Python):
from itertools import groupby, accumulate, product, permutations, combinations
h,w,k = map(int, input().split()) 
l = [input() for i in range(h)]
ans = 0

for i in product([0,1],repeat=h):
    for j in product([0,1],repeat=w):
        Ans = 0
        for m in range(h):
            for n in range(w):
                if l[m][n] == '
                    Ans += 1
        if Ans == k:
            ans +=1

print(ans)