#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 10;
int xy[4][2]={{0,1},{0,-1},{-1,0},{1,0}};
int r, c, s, k;
char G[N][N];
bool v[N][N];
void DFS(int x, int y, int d) {
    if(x == r && y == c) {
        if(d <= k) s++;
        v[x][y] = 0;
    } else for(int i=0; i<4; i++) {
        int X = x+xy[i][0], Y = y+xy[i][1];
        if(X < 1 || X > r || Y < 1 || Y > c) continue;
        if(G[X][Y] == 'T' || v[X][Y]) continue;
        v[X][Y] = 1;
        DFS(X, Y, d+1);
        v[X][Y] = 0;
    }
}
int main() {
    freopen("backbarn.in", "r", stdin);
    freopen("backbarn.out", "w", stdout);
    scanf("%d %d %d\n", &r, &c, &k);
    for(int i=1; i<=r; i++)
        scanf("%s\n", G[i]+1);
    DFS(1, 1, 1);
    printf("%d\n", s);
    return 0;
}