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 in Java (OpenJDK 11.0.6) (judge verdict: Accepted)

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc = new Scanner(System.in);
		int h = sc.nextInt();
		int w = sc.nextInt();
		int k = sc.nextInt();
		char[][] c = new char[h][w];
		
		int count = 0;
		for(int i = 0; i < h; i++) {
			String s = sc.next();
			for(int j = 0; j < w; j++) {
				c[i][j] = s.charAt(j);
				if(c[i][j] == '#') count++;
			}
		}
		
		int ans = 0;
		
		// bit全探索 縦
		for(int i = 0; i < 1 << h; i++) {
			
			//　bit全探索 横
			for(int j = 0; j < 1 << w; j++) {
				
				int count_temp = 0;
				
				// 縦　h回
				for(int ii = 0; ii < h; ii++) {
					
					// 横　w回
					for(int jj = 0; jj < w; jj++) {
						
						if((i >> ii & 1) == 1) {
							// 赤く塗りつぶすと考える
							continue;
						}
						
						if((j >> jj & 1) == 1) {
							// 赤く塗りつぶすと考える
							continue;
						}
					
						// 塗り潰されなかった全マスのii jj の1つ1つのマスが＃ならインクリメント
						if(c[ii][jj] == '#')count_temp++;	
						
					}
					
				}
				
				// 2^h*w パターンの各々の回で求める#の数ならインクリメント
				if(count_temp == k) ans++;
				
			}
			
		}
		
		System.out.println(ans);
		
	}

}