/* Author : samarth
   Handle : ssg_13 */

//----------------------template begins--------------------------------//
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
using namespace std::chrono;

#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define F first
#define S second
#define mp make_pair
#define mt make_tuple
#define eb emplace_back //faster than pb
#define pb push_back 
#define Db(x) cout << '>' << #x << ':' << x << endl;
#define forn(i,n) for(ll i=0;i<n;i++)
#define rforn(i,n) for(ll i=n-1;i>=0;i--)
#define forne(i,n) for(ll i=1;i<=n;i++)
#define forse(i,s,e) for(ll i=s;i<e;i++)
#define rforse(i,s,e) for(ll i=e;i>=s;i--)
#define all(x) x.begin(),x.end()
#define sz(x) (ll)x.size()
#define fill(a,x) memset(a,x,sizeof a);
#define trav(a,x) for(auto &a:x)
#define PT palindromeTest	//Input - string, int, ll, l
#define GS generateSubsets	//Input - n		//Return - vector<vector<int>>
#define GP generatePermutations //Input - int n 	//Return - vector<vector<int>>
#define PF primeFactorization	//Input - ll	//Return - vector<ll>
#define nCr nCrModPFermat   //Input - n, r, p	//Return - nCr mod p
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
	cerr << *it << " = " << a << endl;
	err(++it, args...);
}

typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<ll> vll;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
// find_by_order(i) return pointer to ith index in ordered set


const ll MOD = 1000000007;
ll modpow(ll a,ll b,ll m=MOD) {a%=m;ll res=1;while(b){if(b&1)res=res*a%m;a=a*a%m;b>>=1;}return res;}
ll bpow(ll a, ll b) {ll res = 1;while(b){if(b&1)res=res*a;a=a*a;b>>=1;}return res;}
ll modinv(ll a){return modpow(a,MOD-2,MOD);}
void graph(vector<ll> adj[], ll m){ll x, y; forn(i, m){cin>>x>>y;adj[x-1].pb(y-1);adj[y-1].pb(x-1);}}
ll sum() { return 0; }
template<typename T, typename... Args>
auto sum(T a, Args... args) { return a + sum(args...); }

const ll INF=(ll)1e18;
const int MAXN = 1<<6;
//----------------------template ends--------------------------------//

char c[6][6];
int h,w,k;
bool ans[MAXN][MAXN];
bool vis[MAXN][MAXN];
int stb(string s)
{
    ll p=1;
    int r=0;
    forn(i,s.length())
    {
        r+=(p*(s[i]=='1'));
        p*=2;
    }
    return r;
}
string bts(int n)
{
    string r="";
    forn(i,6)
    {
        r+=(n%2)?'1':'0';
        n/=2;
    }
    return r;
}
void calc(int col_mask,int row_mask)
{
    if(vis[col_mask][row_mask]) return;
    ll cnt=0;
    string  row=bts(row_mask),col=bts(col_mask);
    // error(row,col);
    // error(row_mask,col_mask);    
    forn(i,h) forn(j,w)
    {
        if(col[j]=='0' && row[i]=='0' && c[i][j]=='#') cnt++; 
    }
    // Db(cnt);
    vis[col_mask][row_mask]=1;
    if(cnt<k) return;
    if(cnt==k) ans[col_mask][row_mask]=1;
    forn(i,h)
    {
        if(row[i]=='0') {
            row[i]='1';
            row_mask=stb(row);
            calc(col_mask,row_mask);
            row[i]='0';
            row_mask=stb(row);
        }
    }
    forn(j,w)
    {
        if(col[j]=='0') {
            col[j]='1';
            col_mask=stb(col);
            calc(col_mask,row_mask);
            col[j]='0';
            col_mask=stb(col);
        }
    }
}
int main()
{
fast;
cout << fixed << setprecision(11);
cerr << fixed << setprecision(6);
auto start = high_resolution_clock::now();
ll T;
// cin>>T;
T=1;
while(T--)
{
    cin>>h>>w>>k;
    forn(i,h) forn(j,w) cin>>c[i][j];
    int col_mask=0,row_mask=0;
    fill(vis,0);
    fill(ans,0);
    calc(col_mask,row_mask);
    ll r=0;
    forn(i,MAXN) forn(j,MAXN) if(ans[i][j]) r++;
    cout<<r<<'\n';
}
auto stop = high_resolution_clock::now(); 
auto duration = duration_cast<microseconds>(stop - start);
// cout << "Time taken by function: "
//          << duration.count() << " microseconds" << endl; 
}

Measured memory_bytes: 3640