#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define sci(n) scanf("%d",&n)
#define scii(n,m) scanf("%d%d",&n,&m)
#define scl(n) scanf("%lld",&n)
#define scll(n,m) scanf("%lld%lld",&n,&m)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define xx first
#define yy second
#define READ  freopen("input.txt","r",stdin)
#define WRITE freopen("output.txt","w",stdout);
#define pi acos(-1)
#define SQR(a) (a)*(a)
#define all(v) v.begin(),v.end()
#define pb push_back
#define pri priority_queue<int>
#define rev_pri priority_queue<int,vector<int>,greater<int> >
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define mod 1000000007
#define inf INT_MAX
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define snuke(c,itr) for(__typeof((c).begin()) itr=(c).begin();itr!=(c).end();itr++)

int dx[] = {0,1,0,-1,1,1,-1,-1};
int dy[] = {1,0,-1,0,1,-1,-1,1};
//ll ncr(ll n,ll r){
//    if(n==r)return 1;
//    if(r==1)return n;
//    if(dp[n][r]!=-1)return dp[n][r];
//    return dp[n][r]=ncr(n-1,r)+ncr(n-1,r-1);
//}

//bool checkbit(int mask,int bit){
//    return mask & (1<<bit);
//}
//int setbit(int mask,int bit){
//    return mask | (1<<bit) ;
//}
int clearbit(int mask,int bit){
    return mask & ~(1<<bit);
}
int togglebit(int mask,int bit){
    return mask ^ (1<<bit);
}
int topbit(signed t){
	return t==0?-1:31-__builtin_clz(t);
}
int topbit(ll t){
	return t==0?-1:63-__builtin_clzll(t);
}
int botbit(signed a){
	return a==0?32:__builtin_ctz(a);
}
int botbit(ll a){
	return a==0?64:__builtin_ctzll(a);
}
int popcount(signed t){
	return __builtin_popcount(t);
}
int popcount(ll t){
	return __builtin_popcountll(t);
}
bool ispow2(int i){
	return i&&(i&-i)==i;
}

#define CAPITAL
void yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<"\n";
	#else
	cout<<"Yes"<<"\n";
	#endif
	if(ex)exit(0);
}
void no(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<"\n";
	#else
	cout<<"No"<<"\n";
	#endif
	if(ex)exit(0);
}
void possible(bool ex=true){
	#ifdef CAPITAL
	cout<<"POSSIBLE"<<"\n";
	#else
	cout<<"Possible"<<"\n";
	#endif
	if(ex)exit(0);
}
void impossible(bool ex=true){
	#ifdef CAPITAL
	cout<<"IMPOSSIBLE"<<"\n";
	#else
	cout<<"Impossible"<<"\n";
	#endif
	if(ex)exit(0);
}
template<typename T> bool checkbit(T mask, T bit){
    return mask & (((T)1)<<bit);
}
template<typename T> T setbit(T mask, T bit){
    return mask | (((T)1)<<bit);
}

template <typename T> T BigMod (T b,T p,T m){
    if (p == 0) return 1;if (p%2 == 0){T s = BigMod(b,p/2,m);return ((s%m)*(s%m))%m;}return ((b%m)*(BigMod(b,p-1,m)%m))%m;
}
template <typename T> T ModInv (T b,T m){
    return BigMod(b,m-2,m);
}
template <typename T> T POW(T B,T P){
    if(P==0) return 1; if(P&1) return B*POW(B,P-1);  else return SQR(POW(B,P/2));
}
template <typename T> T Bigmod(T b,T p,T m){
    if(p==0) return 1; else if (!(p&1)) return SQR(Bigmod(b,p/2,m)) % m;else return ((b % m) * Bigmod(b,p-1,m)) % m;
}
template <typename T> T Dis(T x1,T y1,T x2, T y2){
    return sqrt( SQR(x1-x2) + SQR(y1-y2) );
}
template <typename T> T Angle(T x1,T y1,T x2, T y2){
    return atan( double(y1-y2) / double(x1-x2));
}
template <typename T> T DIFF(T a,T b) {
    T d = a-b;if(d<0)return -d;else return d;
}
template <typename T> T ABS(T a) {
    if(a<0)return -a;else return a;
}
template <typename T> T euclide(T a,T b,T &x,T &y) {
    if(a<0){T d=euclide(-a,b,x,y);x=-x;return d;}
    if(b<0){T d=euclide(a,-b,x,y);y=-y;return d;}
    if(b==0){x=1;y=0;return a;}
    else{T d=euclide(b,a%b,x,y);T t=x;x=y;y=t-(a/b)*y;return d;}
}
template <typename T> T gcd(T a,T b){
    if(a<0)return gcd(-a,b);if(b<0)return gcd(a,-b);return (b==0)?a:gcd(b,a%b);
}
template <typename T> T lcm(T a,T b) {
    if(a<0)return lcm(-a,b);if(b<0)return lcm(a,-b);return a*(b/gcd(a,b));
}

template<class t>
int lwb(const vector<t>&v,const t&a){
	return lower_bound(all(v),a)-v.bg;
}

template<typename A, typename B>
class Dijkstra {
public:
    vector<vector<pair<int, A>>> vertexs;
    vector<int>par;
    B Cost_Function;
    Dijkstra(int n, B cost) : Cost_Function(cost) {
        vertexs = vector<vector<pair<int, A>>>(n, vector<pair<int, A>>{});
        par = vector<int>(n);
    }
    ~Dijkstra() {
        vertexs.clear();
    }
    void add_edge(int a, int b, A c) {
        vertexs[a].push_back(make_pair(b, c));
    }
    void clr(){par.clear(); }
    vector<ll> build_result(int StartPoint) {
        vector<ll> dist(vertexs.size(), 2e18);
        dist[StartPoint] = 0;
        priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> next;
        next.push(make_pair(0, StartPoint));
        while (next.empty() == false) {
            pair<ll, int> now = next.top();
            next.pop();
            if (dist[now.second] != now.first) continue;
            for (auto x : vertexs[now.second]) {
                ll now_cost = now.first + x.second;// Cost_Function(x.second);
                if (dist[x.first] > now_cost) {
                    dist[x.first] = now_cost;
                    par[x.first] = now.second;
                    next.push(make_pair(now_cost, x.first));
                }
            }
        }
        return dist;
    }
};
const ll MOD = (ll)mod;
ll add(ll x, ll y) {
	x += y;
	if (x >= MOD) return x - MOD;
	return x;
}
ll sub(ll x, ll y) {
	x -= y;
	if (x < 0) return x + MOD;
	return x;
}
ll mult(ll x, ll y) {
	return (x * y) % MOD;
}
ll bin_pow(ll x, ll p) {
	if (p == 0) return 1;
	if (p & 1) return mult(x, bin_pow(x, p - 1));
	return bin_pow(mult(x, x), p / 2);
}
ll rev(ll x) {
	return bin_pow(x, MOD - 2);
}


//#define oj.txt
const ll nax=1000050;
ll n,w,m;
ll ar[10][10],rw[10],cl[10];
vector<string>s;
void solve()
{
    ll a,b,c,q,j,k,l,mx=0,i;
    ll hn,hm,gc,sx,sy,ex=1,ey=-1;
    scll(n,m);
    scl(w);
    FOR(i,0,10) rw[i]=cl[i]=0;
    string st;
    for(i=1;i<=n;i++){
        cin>>st;
        s.pb(st);
    }
    for(i=0;i<s.size();i++){
        mx=0;
        for(j=0;j<s[i].size();j++) if(s[i][j]=='#')mx++;
        rw[i]=mx;
    }//cout<<"A"<<endl;
    for(j=0;j<m;j++){
        mx=0;
        for(i=0;i<n;i++) if(s[i][j]=='#')mx++;
        cl[j]=mx;
    }ex=0;
    hn=POW(2LL,n)-1;
    hm=POW(2LL,m)-1;
    for(i=0;i<=hn;i++){
        for(k=0;k<10;k++) rw[k]=0;
        for(k=0;k<n;k++)if(i&(1<<k)){rw[k]=1; }
        for(j=0;j<=hm;j++){
            mx=0;
            for(k=0;k<10;k++) cl[k]=0;
            for(k=0;k<m;k++)if(j&(1<<k)){cl[k]=1; }
            for(a=0;a<n;a++)if(rw[a]){
                for(b=0;b<m;b++){if(cl[b]&&s[a][b]=='#') mx++;}
            }if(mx==w){ex++;}
        }
    }cout<<ex<<'\n';
}
int main()
{
    //IOS;
    #ifdef oj.txt
    READ;
    WRITE;
    #endif // oj
    clock_t tStart = clock();
    ll t=1,mex=1;
   //cin>>t;
    while(t--){
        solve();
    }
    //fprintf(stderr, "Time = %.10fs\n", (double)(clock() - tStart) / CLOCKS_PER_SEC);
    return 0;
}


Measured memory_bytes: 3688