#include <bits/stdc++.h>
using namespace std;
long long n, m, k, r[7], c[7];
string s;
vector<long long> rowsofcol[7];
char ch;
long long subsetsum(long long k_, long long n_) {
  if (k_ < 0) return 0;
  if (n_ == 0 && k_ != 0) return 0;
  if (n_ == 0) return 1;
  return (subsetsum(k_, n_ - 1) + subsetsum(k_ - r[n_], n_ - 1));
}
void countans(long long i, vector<long long> selectedcols, long long &ans) {
  if (i == m + 1) {
    ans += subsetsum(k, n);
    return;
  }
  countans(i + 1, selectedcols, ans);
  k -= c[i];
  for (long long j = 0; j < (long long)(rowsofcol[i].size()); j++)
    --r[rowsofcol[i][j]];
  selectedcols.push_back(i);
  countans(i + 1, selectedcols, ans);
  k += c[i];
  for (long long j = 0; j < (long long)(rowsofcol[i].size()); j++)
    ++r[rowsofcol[i][j]];
  selectedcols.pop_back();
}
void solve() {
  cin >> n >> m >> k;
  memset(r, 0, sizeof(r));
  memset(c, 0, sizeof(c));
  long long countblack = 0;
  for (long long i = 1; i < n + 1; i++) {
    for (long long j = 1; j < 1 + m; j++) {
      cin >> ch;
      if (ch == '#') {
        r[i]++;
        c[j]++;
        rowsofcol[j].push_back(i);
        countblack++;
      }
    }
  }
  k = countblack - k;
  vector<long long> col;
  long long ans = 0;
  countans(1, col, ans);
  cout << ans << endl;
}
void aux() {}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  aux();
  long long _ = 1;
  while (_--) {
    solve();
  }
  return 0;
}
