import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.*;

public class Main {
    static PrintWriter out;
    static CF_Reader in;
    static ArrayList<Integer>[] adj;
    static int rowLen;
    static int colLen;
    static int k;
    static int total;
    static int[][] grid;

    public static void main(String[] args) throws IOException {
        out = new PrintWriter(new OutputStreamWriter(System.out));
        in = new CF_Reader();

        rowLen = in.intNext();
        colLen = in.intNext();
        k = in.intNext();
        grid = new int[rowLen][colLen];
//        HashMap<Integer, Integer> colCounts = new HashMap<>();
//        HashMap<Integer, Integer> rowCounts = new HashMap<>();
        total = 0;
        for (int r = 0; r < rowLen; r++) {
            String chars = in.next();
            for (int c = 0; c < colLen; c++) {
                grid[r][c] = (chars.charAt(c) == '#') ? 1 : 0;
//                colCounts.merge(c, grid[r][c], Integer::sum);
//                rowCounts.merge(r, grid[r][c], Integer::sum);
                total += grid[r][c];
            }
        }

        int ans = 0;
        int rowSubsets = 1 << rowLen;
        int colSubsets = 1 << colLen;
        for (int r = 0; r < rowSubsets; r++) {
            for (int c = 0; c < colSubsets; c++) {
                ans += checkBlacks(r, c);
            }
        }
        out.println(ans);

        out.close();
    }

    static int checkBlacks(int rowMask, int colMask) {
//        out.printf("%d %d\n", rowMask, colMask);
        HashSet<Integer> rows = new HashSet<>();
        HashSet<Integer> cols = new HashSet<>();
        for (int i = 0; i < rowLen; i++) {
            int mask = (rowMask & (1 << i));
            if (mask != 0) rows.add(i);
        }
        for (int i = 0; i < colLen; i++) {
            int mask = (colMask & (1 << i));
            if (mask != 0) cols.add(i);
        }
        int count = 0;
        for (int rw = 0; rw < rowLen; rw++) {
            for (int cl = 0; cl < colLen; cl++) {
                if (!rows.contains(rw) && !cols.contains(cl)) count += grid[rw][cl];
            }
        }
//        out.println(count);
        return (count == k) ? 1 : 0;
    }

    static class CF_Reader {
        BufferedReader br;
        StringTokenizer st;

        public CF_Reader() throws IOException {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        public ArrayList<Integer>[] adjacencyList(int n, int m) throws IOException {
            ArrayList<Integer>[] adj = new ArrayList[n + 1];
            for (int i = 1; i <= n; i++) adj[i] = new ArrayList<>();
            for (int i = 0; i < m; i++) {
                int a = intNext(), b = intNext();
                adj[a].add(b);
                adj[b].add(a);
            }
            return adj;
        }

        String next() throws IOException {
            while (st == null || !st.hasMoreTokens())
                st = new StringTokenizer(br.readLine().trim());
            return st.nextToken();
        }

        long longNext() throws IOException {
            return Long.parseLong(next());
        }

        int intNext() throws IOException {
            return Integer.parseInt(next());
        }

        double doubleNext() throws IOException {
            return Double.parseDouble(next());
        }

        char charNext() throws IOException {
            return next().charAt(0);
        }

        public int[] nextIntArray(final int n) throws IOException {
            final int[] a = new int[n];
            for (int i = 0; i < n; i++)
                a[i] = intNext();
            return a;
        }

        public long[] nextLongArray(final int n) throws IOException {
            final long[] a = new long[n];
            for (int i = 0; i < n; i++)
                a[i] = longNext();
            return a;
        }

        String line() throws IOException {
            return br.readLine().trim();
        }
    }

    static class util {
        public static int upperBound(long[] array, long obj) {
            int l = 0, r = array.length - 1;
            while (r - l >= 0) {
                int c = (l + r) / 2;
                if (obj < array[c]) {
                    r = c - 1;
                } else {
                    l = c + 1;
                }
            }
            return l;
        }

        public static int upperBound(ArrayList<Long> array, long obj) {
            int l = 0, r = array.size() - 1;
            while (r - l >= 0) {
                int c = (l + r) / 2;
                if (obj < array.get(c)) {
                    r = c - 1;
                } else {
                    l = c + 1;
                }
            }
            return l;
        }

        public static int lowerBound(long[] array, long obj) {
            int l = 0, r = array.length - 1;
            while (r - l >= 0) {
                int c = (l + r) / 2;
                if (obj <= array[c]) {
                    r = c - 1;
                } else {
                    l = c + 1;
                }
            }
            return l;
        }

        public static int lowerBound(ArrayList<Long> array, long obj) {
            int l = 0, r = array.size() - 1;
            while (r - l >= 0) {
                int c = (l + r) / 2;
                if (obj <= array.get(c)) {
                    r = c - 1;
                } else {
                    l = c + 1;
                }
            }
            return l;
        }

        public static void print(long[] arr) {
            System.out.println(Arrays.toString(arr));
        }

        public static void print(int[] arr) {
            System.out.println(Arrays.toString(arr));
        }

        public static void print(char[] arr) {
            System.out.println(Arrays.toString(arr));
        }
    }

    static class Tuple implements Comparable<Tuple> {
        int a;
        int b;

        public Tuple(int a, int b) {
            this.a = a;
            this.b = b;
        }

        public int getA() {
            return a;
        }

        public int getB() {
            return b;
        }

        public int compareTo(Tuple other) {
            if (this.a == other.a) return Integer.compare(this.b, other.b);
            return Integer.compare(this.a, other.a);
        }

        @Override
        public int hashCode() {
            return Arrays.deepHashCode(new Integer[]{a, b});
        }

        @Override
        public boolean equals(Object o) {
            if (!(o instanceof Tuple)) return false;
            Tuple pairo = (Tuple) o;
            return (this.a == pairo.a && this.b == pairo.b);
        }

        @Override
        public String toString() {
            return String.format("%d,%d  ", this.a, this.b);
        }
    }
}




Measured memory_bytes: 37220