/*****Author: Satyajeet Singh, Delhi Technological University************************************/
    import java.io.*;
    import java.util.*;
    import java.text.*; 
    import java.lang.*;
    import java.math.*;
public class Main{
/*********************************************Constants******************************************/
    static PrintWriter out=new PrintWriter(new OutputStreamWriter(System.out));        
    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    static long mod=(long)1e9+7;
    static long mod1=998244353;
    static ArrayList<Integer> graph[];
    static int pptr=0,pptrmax=0;
    static String st[];
/*****************************************Solution Begins***************************************/    
    static int n,m,input[][],ans=0,k;
    static void dfs(){
        int cnt=0;
        // if(x==n-1&&y==m-1){
            for(int i=0;i<n;i++){
                for(int j=0;j<m;j++){
                    if(input[i][j]==1)cnt++;
                }
            }
            if(cnt==k)ans++;
            return;
        // }
        // if(x>=n||y>=m)return;
        // dfs(x+1,y);
        // dfs(x,y+1);
        // int store[]=new int[n];
        // for(int i=0;i<n;i++){
        //     store[i]=input[i][y];
        //     input[i][y]=2;
        // }
        // dfs(x,y+1);

        // for(int i=0;i<n;i++)
        //     input[i][y]=store[i];

        // store=new int[m];
        // for(int i=0;i<m;i++){
        //     store[i]=input[x][i];
        //     input[x][i]=2;
        // }
        // dfs(x+1,y);
        // for(int i=0;i<m;i++){
        //     input[x][i]=store[i];
        // }
    }
    static int clo[][];
    static void copy(){
        for(int i=0;i<n;i++){
            for(int j=0;j<m;j++){
                input[i][j]=clo[i][j];
            }
        }
    }
    static void row(int x){
        for(int i=0;i<m;i++){
            input[x][i]=2;
        }
    }
    static void col(int x){
        for(int i=0;i<n;i++){
            input[i][x]=2;
        }
    }
    public static void main(String args[]) throws Exception{
        n=pi();
        m=pi();
        k=pi();
        input=new int[n][m];
        clo=new int[n][m];

        for(int i=0;i<n;i++){
            String inp=ps();
            for(int j=0;j<m;j++){
                if(inp.charAt(j)=='#')
                    input[i][j]++;
                clo[i][j]=input[i][j];
            }
        }
        ans=0;
        int s=n+m;
        for(int mask=0;mask<(1<<s);mask++){
            copy();
            for(int i=0;i<s;i++){
                if((mask&(1<<i))==0)continue;
                if(i<=n-1)row(i);
                else col(i-n);
            }
            dfs();
        }
        
        out.println(ans);
/****************************************Solution Ends**************************************************/
        out.flush();
        out.close();
    }
/****************************************Template Begins************************************************/
    static void nl() throws Exception{
        pptr=0;
        st=br.readLine().split(" ");
        pptrmax=st.length;
    }
    static void nls() throws Exception{
        pptr=0;
        st=br.readLine().split("");
        pptrmax=st.length;
    }
    static int pi() throws Exception{
        if(pptr==pptrmax)
            nl();
        return Integer.parseInt(st[pptr++]);
    }
    static long pl() throws Exception{
        if(pptr==pptrmax)
            nl();
        return Long.parseLong(st[pptr++]);
    }
    static double pd() throws Exception{
        if(pptr==pptrmax)
            nl();
        return Double.parseDouble(st[pptr++]);
    }
    static String ps() throws Exception{
        if(pptr==pptrmax)
            nl();
        return st[pptr++];
    }
/***************************************Precision Printing**********************************************/
    static void printPrecision(double d){
        DecimalFormat ft = new DecimalFormat("0.0000000000"); 
        out.println(ft.format(d));
    }
/**************************************Bit Manipulation**************************************************/
    static int countBit(long mask){
        int ans=0;
        while(mask!=0){
            mask&=(mask-1);
            ans++;
        }
        return ans;
    }
/******************************************Graph*********************************************************/
    static void Makegraph(int n){
        graph=new ArrayList[n];
        for(int i=0;i<n;i++)
            graph[i]=new ArrayList<>();
    }
    static void addEdge(int a,int b){
        graph[a].add(b);
    }
    // static void addEdge(int a,int b,int c){
    //     graph[a].add(new Pair(b,c));
    // }    
/*********************************************PAIR********************************************************/
    static class Pair{
        int u;
        int v;
        public Pair(int u, int v) {
            this.u = u;
            this.v = v;
        }
        public int hashCode() {
            int hu = (int) (u ^ (u >>> 32));
            int hv = (int) (v ^ (v >>> 32));
            return 31 * hu + hv;
        }
        public boolean equals(Object o) {
            Pair other = (Pair) o;
            return u == other.u && v == other.v;
        }
        public String toString() {
            return "[u=" + u + ", v=" + v + "]";
        }
    }
/******************************************Long Pair*******************************************************/
    static class Pairl{
        long u;
        long v;
        public Pairl(long u, long v) {
            this.u = u;
            this.v = v;
        }
        public int hashCode() {
            int hu = (int) (u ^ (u >>> 32));
            int hv = (int) (v ^ (v >>> 32));
            return 31 * hu + hv;
        }
        public boolean equals(Object o) {
            Pairl other = (Pairl) o;
            return u == other.u && v == other.v;
        }
        public String toString() {
            return "[u=" + u + ", v=" + v + "]";
        }
    }
/*****************************************DEBUG***********************************************************/
    public static void debug(Object... o){
        System.out.println(Arrays.deepToString(o));
    }
/************************************MODULAR EXPONENTIATION***********************************************/
    static long modulo(long a,long b,long c){
        long x=1,y=a%c;
        while(b > 0){
            if(b%2 == 1)
                x=(x*y)%c;
            y = (y*y)%c;
            b = b>>1;
        }
        return  x%c;
    }
/********************************************GCD**********************************************************/
    static long gcd(long x, long y){
        if(x==0)
            return y;
        if(y==0)
            return x;
        long r=0, a, b;
        a = (x > y) ? x : y; 
        b = (x < y) ? x : y;
        r = b;
        while(a % b != 0){
            r = a % b;
            a = b;
            b = r;
        }
        return r;
    }
}

Measured memory_bytes: 26112