import java.io.IOException;
import java.io.InputStream;
import java.util.NoSuchElementException;
import java.util.*;

class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;

    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        } else {
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }

    private int readByte() {
        if (hasNextByte())
            return buffer[ptr++];
        else
            return -1;
    }

    private static boolean isPrintableChar(int c) {
        return 33 <= c && c <= 126;
    }

    public boolean hasNext() {
        while (hasNextByte() && !isPrintableChar(buffer[ptr]))
            ptr++;
        return hasNextByte();
    }

    public String next() {
        if (!hasNext())
            throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    public long nextLong() {
        if (!hasNext())
            throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while (true) {
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            } else if (b == -1 || !isPrintableChar(b)) {
                return minus ? -n : n;
            } else {
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }

    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)
            throw new NumberFormatException();
        return (int) nl;
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }
}

public class Main {
    static int MOD = 1000000007;

    public static class Mas {
        int x;
        int y;
        int step;

        Mas(int x, int y, int step) {
            this.x = x;
            this.y = y;
            this.step = step;
        }
    }

    static long pow(long l, long i) {
        if (i == 0)
            return 1;
        else {
            if (i % 2 == 0) {
                long val = pow(l, i / 2);
                return val * val % 2019;
            } else {
                return pow(l, i - 1) * l % 2019;
            }
        }
    }

    private static final int[] vX = { 1, 0, 0, -1 };
    private static final int[] vY = { 0, 1, -1, 0 };

    static class Edge {
        int idx;
        int node;

        public Edge(int n, int i) {
            this.idx = i;
            this.node = n;
        }
    }

    public static void main(String[] args) throws IOException {
        FastScanner fs = new FastScanner();
        int H = fs.nextInt();
        int W = fs.nextInt();
        int K = fs.nextInt();
        char[][] g = new char[H][W];
        int[] bh = new int[H];
        int[] bw = new int[W];
        for (int i = 0; i < H; i++) {
            g[i] = fs.next().toCharArray();
        }
        int sumb = 0;
        for (int i = 0; i < H; i++) {
            for (int j = 0; j < W; j++) {
                if (g[i][j] == '#') {
                    bh[i]++;
                    bw[j]++;
                    sumb++;
                }
            }
        }
        long ans = 0;
        for (int bit = 0; bit < (1 << H); bit++) {
            for (int bit2 = 0; bit2 < (1 << W); bit2++) {
                int num = sumb;
                boolean[][] gb = new boolean[H][W];
                for (int j = 0; j < H; j++) {
                    if ((bit >> j & 1) == 1) {
                        num -= bh[j];
                        Arrays.fill(gb[j], true);
                    }
                }
                for (int j = 0; j < W; j++) {
                    if ((bit2 >> j & 1) == 1) {
                        num -= bw[j];
                        for (int i = 0; i < H; i++) {
                            if (gb[i][j] && g[i][j]=='#') {
                                num++;
                            }
                        }
                    }
                }
                // int count = 0;
                // // for (int i = 0; i < H; i++) {
                // // if (((bit >> i) & (bit2 >> i)) == 1) {
                // // count++;
                // // }
                // // }

                // int tmp = bit & bit2;
                // while (tmp > 0) {
                //     tmp /= Math.pow(2, count + 1);
                //     if (g[count][count] == '#') {
                //         count++;
                //     }
                 
                // }

                // num += count;

                if (num == K) {
                    // // System.out.print(Integer.bitCount(tmp));
                    // System.out.print(" H:");
                    // for (int i = 0; i < H; i++) {

                    // System.out.print(bit>>i & 1);
                    // }
                    // System.out.print(" W:");
                    // for (int i = 0; i < W; i++) {

                    // System.out.print(bit2 >> i & 1);
                    // }
                    // System.out.println();

                    ans++;
                }
            }
        }

        System.out.println(ans);

    }
}


Measured memory_bytes: 33624