#include <bits/stdc++.h>
using namespace std;
#define REP(i,x,n) for(int i=x;i<(int)n;i++)
#define rep(i,n) REP(i,0,n)
#define sp(p) cout<<setprecision(16)<<fixed<<p<<endl;
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define SORT(a) sort(all(a))
#define RSORT(a) sort(rall(a))
#define UNIQ(a) unique(all(a))
#define UNIQNUM(a) UNIQ(a)-a.begin()
#define UNIQIT(a) a.erase(UNIQ(a), a.end());
#define VOUT(v,i) rep(i,v.size())cout<<v[i]<<(i==v.size()-1?"\n":" ");
#define vout(v) VOUT(v,z);
#define vdbg(v,i) cout<<#v<<": ";for(int i=0;i<(int)v.size();i++){cout<<v[i]<<" ";}cout<<"\n";
#define vmin(v) *min_element(all(v))
#define vmax(v) *max_element(all(v))
#define vsum(v) accumulate(all(v), 0LL)
#define MOUT(m,r,c) rep(i,r){rep(j,c){cout<<m[i][j]<<" ";}cout<<endl;}
#define mout(m) MOUT(m,m.size(),m[0].size())
#define debg(a) cout<<#a<<": "<<a<<endl;
#define show(a) for(cont &y:a){for(cont &x:y){cout<<x<<" ";}cout<<endl;}
#define digit(a) to_string(a).length();
template<class T>inline int out(const T &t){ print(t); putchar('\n'); return 0; }
// template<class T>inline T gcd(T a,T b){if(b==0)return a; return(gcd(b,a%b));}
// template<class T>inline T lcm(T a,T b){return a/gcd(a,b)*b;}
bool is_palindrome(string s){return s == string(s.rbegin(),s.rend());}
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef vector<ll> V;
typedef vector<vector<ll>> VV;
// const long long MOD=1000000007;
const long long INF = 1e18;
#define EPS (1e-7)
#define PI (acos(-1))
template<class T>
inline bool chmax(T &a, T b) {
    if(a < b) { a = b; return true; }
    return false;
}
template<class T>
inline bool chmin(T &a, T b) {
    if(a > b) { a = b; return true; }
    return false;
}



int main(){
    ll H,W,K;
    cin >> H >> W >> K;
    vector<vector<char>> c(H, vector<char>(W));
    for (long long i = 0; i < H; i++) {
        for (long long j = 0; j < W; j++) {
            cin >> c[i][j];
        }
    }
    // mout(c);

    ll ret=0;
    ll n = H;
    for (ll bit = 0; bit < (1<<n); bit++) {
        // ll cnt=0;
        V v;
        // V w;
        for (ll i = 0; i < n; i++) {
            if(bit & (1<<i)) {
                v.push_back(i);
            }else{
                // w.push_back(i);
            }
        }

        ll m = W;
        for (ll bit = 0; bit < (1<<m); bit++) {
            // V v;
            V w;
            for (ll i = 0; i < m; i++) {
                if(bit & (1<<i)) {
                    w.push_back(i);
                }else{
                    // w.push_back(i);
                }
            }

            ll cnt=0;
            for (long long i = 0; i < H; i++) {
                if(find(all(v), i) == v.end()) continue;
                for (long long j = 0; j < W; j++) {
                    if(find(all(w), j) == w.end()) continue;
                    if(c[i][j]=='#') cnt++;
                }
            }

            // cout << bit << ": ";
            // for (ll i = 0; i < v.size(); i++) {
            //     cout << v[i] << " ";
            // }
            // cout << endl;
            if(cnt==K) ret++;

        }

        // cout << bit << ": ";
        // for (ll i = 0; i < v.size(); i++) {
        //     cout << v[i] << " ";
        // }
        // cout << endl;

    }
    cout << ret << endl;

    return 0;
}


Measured memory_bytes: 3632