#pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
#if __cplusplus >= 201103L
#include <chrono>
using namespace std::chrono;
#endif
using namespace std;
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define CASET int ___T; scanf("%d", &___T); for(int cs=1;cs<=___T;cs++)
#ifdef LOCAL
#define prln(x) (cout << #x << ' ' << x << endl)
#define pr(x) (cout << #x << ' ' << x << ' ' )
#define prv(x) (cout << x << ' ')
#else
#define prln(x) 
#define pr(x)
#define prv(x)
#endif
#define clr(x) memset((x), 0, sizeof((x)))
#define clr1(x) memset((x), -1, sizeof((x)))
#define endl "\n"
#define pi acos(-1)
#define rep(i, st, ed) for (int i = (st); i <= (ed); ++i)
#define rep0(i, st, ed) for (int i = (st); i < (ed); ++i)
#define per0(i, st, ed) for (int i = (st); i > ed; --i)
#define per(i, st, ed) for (int i = (st); i >= ed; --i)
#define chmin(a, b) (a = a > b ? b : a)
#define chmax(a, b) (a = a < b ? b : a)
template<class T> void _sf(T &x) {cin >> x;}
void _sf(int &x) {scanf("%d", &x);}
void _sf(ll &x) {scanf("%lld", &x);}
void _sf(double &x) {scanf("%lf", &x);}
void _sf(char &x) {scanf(" %c", &x);}
void _sf(char *x) {scanf("%s", x);}
void sf() {}
template <class T, class...U> void sf(T & head, U&... tail) { _sf(head); sf(tail...);}
template<class T> void _out(const T &x) { cout << x; }
void _out(const int &x) { printf("%d", x); }
void _out(const ll &x) { printf("%lld", x); }
void _out(const double &x) { printf("%.16f", x); }
void _out(const char &x) { putchar(x); }
void _out(const char *x) { printf("%s", x); }
template<class T,class U> void _out(const pair<T,U> &x) {_out(x.F); putchar(' '); _out(x.S);}
template<class T> void _out(const vector<T> &x) { for (auto i = x.begin(); i != x.end(); _out(*i++)) if (i != x.cbegin()) putchar(' '); }
void out() {}
template<class T, class... U> void out(const T &head, const U &... tail) { _out(head); putchar(sizeof...(tail) ? ' ' : '\n'); out(tail...); }
const int mod = 1e9 + 7;
const int INF = 0x3f3f3f3f;

int read() {
	int x = 0, f = 1;
	char ch = getchar();
	while (ch < '0' || ch > '9') {
		if (ch == '-') f = -1;
		ch = getchar();
	}
	while (ch >= '0' && ch <= '9') {
		x = x * 10 + ch - '0';
		ch = getchar();
	}
	return x * f;
}

const int maxn = 10;
int x[maxn];
int y[maxn];
char s[maxn][maxn];


int main(){
	#ifdef LOCAL
		freopen("in.txt", "r", stdin);
		freopen("out.txt", "w", stdout);
	#endif
	int h, w, k;
	// sf(h, w, k);
	cin >> h >> w >> k;
	// prln(h, w, k);
	pr(h);prln(k);
	rep(i, 1, h) {
		rep(j, 1, w) {
			cin >> s[i][j];
		}
	}
	int sum = 0;
	rep(i, 1, h) {
		rep(j, 1, w) {
			if (s[i][j] == '#') ++sum;
		}
	}
	for (int i = 1; i <= h; ++i) {
		int cnt = 0;
		for (int j = 1; j <= w; ++j) {
			if (s[i][j] == '#') ++cnt;
		}
		x[i] = cnt;
		// pr(i);prln(x[i]);
	}
	// prln("zzz");
	for (int j = 1; j <= w; ++j) {
		int cnt = 0;
		for (int i = 1; i <= h; ++i) {
			if (s[i][j] == '#') ++cnt;
		}
		y[j] = cnt;
		// pr(j);prln(y[j]);
	}
	// prln(sum);
	int ans = 0;
	// for (int i = 1; i <= h; ++i) {
	// 	for (int j = 1; j <= w; ++j) {
	// 		int t = sum;
	// 		// if (s[i][j] == '#') --t;
	// 		t -= x[i];
	// 		t -= y[j];

	// 		if (s[i][j] == '#') ++t;
	// 		pr(i);pr(j);prln(t);
	// 		if (t == k) ++ans;
	// 	}
	// }

	for (int i = 0; i < (1 << h); ++i) {
		for (int j = 0; j < (1 << w); ++j) {
			int cnt = 0;
			for (int x = 1; x <= h; ++x) {
				for (int y = 1; y <= w; ++y) {
					if ( ((1 << (x - 1)) & i) && ((1 << (y - 1)) & j)) {
						if (s[x][y] == '#') ++cnt;
					}
				}
			}
			if (cnt == k) ++ans;

		}
	}

	out(ans);
	return 0;
}

Measured memory_bytes: 3768