#include <stdio.h>
#include <vector>

using namespace std;

FILE* fin, *fout;

int n, m, k;
char a[200][200];
int startx, starty, n_trafika;

void input() {
     char c;
     fin = fopen("kredit.in", "r");
     fscanf(fin, "%d%d%d%c", &n, &m, &k, &c);

     for (int i = 0; i < n; i++)
          fscanf(fin, "%s", &a[i]);
     fclose(fin);
}

void init() {
     input();
     for (int i = 0; i < n; i++)
         for (int j = 0; j < m; j++) {
             if (a[i][j] == 'F') {
                startx = i; starty = j;
             }
         }
}

bool in(int x, int y) {
     return (x >= 0 && x < n && y >= 0 && y < m && a[x][y] != 'X');
}

void bfs(vector<pair<int, int> > start, int dist[][200], int limit) {
     vector<pair<int, int> > next, now(start);
     for (int i = 0; i < now.size(); i++)
         dist[now[i].first][now[i].second] = 0;
     for (int i = 0; i < limit && !now.empty(); i++) {
         for (int j = 0; j < now.size(); j++) {
             pair<int, int> pos = now[j];
             int x = pos.first, y = pos.second;
             if (in(x+1, y))
                if (dist[x+1][y]==-1) {
                   next.push_back(make_pair(x+1,y));
                   dist[x+1][y] = i+1;
                }
             if (in(x-1, y))
                if (dist[x-1][y]==-1) {
                   next.push_back(make_pair(x-1,y));
                   dist[x-1][y] = i+1;
                }
             if (in(x, y+1))
                if (dist[x][y+1]==-1) {
                   next.push_back(make_pair(x,y+1));
                   dist[x][y+1] = i+1;
                }
             if (in(x, y-1))
                if (dist[x][y-1]==-1) {
                   next.push_back(make_pair(x,y-1));
                   dist[x][y-1] = i+1;
                }
        }
        now.clear();
        next.swap(now);
     }
}

void output(int min, int max) {
     fout = fopen("kredit.out", "w");
     fprintf(fout, "%d %d\n", min, max);
     fclose(fout);
}

int main(int argc, char *argv[])
{
    init();
    int dist1[n][200], dist2[n][200];
    
    vector<pair<int, int> > s;
    s.push_back(make_pair(startx, starty));
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            dist1[i][j] = -1;
    bfs(s, dist1, k);
    
    vector<pair<int, int> > t;
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++) {
            dist2[i][j] = -1;
            if (a[i][j] == 'T')
               t.push_back(make_pair(i, j));
        }
    bfs(t, dist2, 1000000);
    
    int max = 0, min = 1000000;
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            if (dist1[i][j] != -1) {
               if (dist2[i][j] > max) 
                  max = dist2[i][j];
               if (dist2[i][j] < min)
                  min = dist2[i][j];                  
            }
    output(min, max);
    return 0;
}