You already know that Valery's favorite sport is biathlon. Due to your help, he learned to shoot without missing, and his skills are unmatched at the shooting range. But now a smaller task is to be performed, he should learn to complete the path fastest.

The track's map is represented by a rectangle n × m in size divided into squares. Each square is marked with a lowercase Latin letter (which means the type of the plot), with the exception of the starting square (it is marked with a capital Latin letters S) and the terminating square (it is marked with a capital Latin letter T). The time of movement from one square to another is equal to 1 minute. The time of movement within the cell can be neglected. We can move from the cell only to side-adjacent ones, but it is forbidden to go beyond the map edges. Also the following restriction is imposed on the path: it is not allowed to visit more than k different types of squares (squares of one type can be visited an infinite number of times). Squares marked with S and T have no type, so they are not counted. But S must be visited exactly once — at the very beginning, and T must be visited exactly once — at the very end.

Your task is to find the path from the square S to the square T that takes minimum time. Among all shortest paths you should choose the lexicographically minimal one. When comparing paths you should lexicographically represent them as a sequence of characters, that is, of plot types.

Input

The first input line contains three integers n, m and k (1 ≤ n, m ≤ 50, n·m ≥ 2, 1 ≤ k ≤ 4). Then n lines contain the map. Each line has the length of exactly m characters and consists of lowercase Latin letters and characters S and T. It is guaranteed that the map contains exactly one character S and exactly one character T.

Pretest 12 is one of the maximal tests for this problem.

Output

If there is a path that satisfies the condition, print it as a sequence of letters — the plot types. Otherwise, print "-1" (without quotes). You shouldn't print the character S in the beginning and T in the end.

Note that this sequence may be empty. This case is present in pretests. You can just print nothing or print one "End of line"-character. Both will be accepted.

Examples

Input

5 3 2
Sba
ccc
aac
ccc
abT


Output

bcccc


Input

3 4 1
Sxyy
yxxx
yyyT


Output

xxxx


Input

1 3 3
TyS


Output

y


Input

1 4 1
SxyT


Output

-1
20 10 3
ebebccacdb
eeebccddeT
eadebecaac
adeeeaccbc
baccccdaed
deabceabba
dadbecbaaa
eacbbcedcb
aeeScdbbab
babaecaead
bacdbebeae
aacbadbeec
acddceecca
acaeaebaba
cdddeaaeae
eabddadade
ddddaeaeed
bccbaacadd
dccccbabdc
ecdaebeccc
 1 30 2
bmjcfldkloleiqqiTnmdjpaSckkijf
 15 15 3
cbbdccabdcbacbd
bcabdcacadacdbc
cbcddbbcdbddcad
ddcabdbbdcabbdc
aabadcccTcabdbb
cbacaaacaabdbbd
dbdcbSdabaadbdb
dbbaddcdddaadbb
bbddcdcbaccbbaa
adadadbdbbddccc
cddbbdaddcbbdcc
bbaadcdbbcaacca
adbdcdbbcbddbcd
cdadbcccddcdbda
cbcdaabdcabccbc
 10 8 2
bdcdcbfa
decffcce
dTffdacb
eeedcdbb
fdbbbcba
ddabfcda
abdbSeed
bdcdcffa
cadbaffa
fcccddad
 20 20 2
ddadfcdeTaeccbedeaec
acafdfdeaffdeabdcefe
abbcbefcdbbbcdebafef
fdafdcccbcdeeaedeffc
dfdaabdefdafabaabcef
febdcabacaaaabfacbbe
abfcaacadfdbfdbaaefd
dacceeccddccaccdbbce
cacebecabedbddfbfdad
dacbfcabbebfddcedffd
cfcdfacfadcfbcebebaa
ddfbebafaccbebeefbac
ebfaebacbbebdfcbcbea
dfbaebcfccacfeaccaad
edeedeceebcbfdbcdbbe
afaacccfbdecebfdabed
ddbdcedacedadeccaeec
ecbSeacbdcccbcedafef
cfdbeeffbeeafccfdddb
cefdbdfbabccfdaaadbf
 2 1 4
S
T
 3 5 2
SbcaT
acbab
acccb
 3 4 1
SbbT
aaaa
abba
 5 3 4
aaT
acc
bbb
bbc
cSb
 1 50 3
SaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaTaaaaaaaaaaa
 3 3 1
aaa
aaa
TSa
 6 6 3
pkhipk
mlfmak
aqmbae
dlbfSj
dpbjcr
aTbqbm
 3 4 1
Sbbb
aaaT
abbc
 5 5 1
caTbc
dccac
dacda
aacaS
cdcab
 1 40 1
faSfgfTcfadcdfagfbccbffbeaaebagbfcfcgdfd
 1 3 3
SaT
 1 10 2
baaSaaTacb
 20 20 2
baaaaaaaaaaaaaaaaaaa
bfffffffacfffffffffa
bgggggggaccgggggggga
bhhhhhhhaccchhhhhhha
biiiiiiiacccciiiiiia
bjjjjjjjacccccjjjjja
bkkkkkkkacccccckkkka
blllllllacccccccllla
bbbbbbbbSccccccccmma
bddddddddddcccccccna
bodddddddcccccccccca
bppddddddddTaaaaaaaa
bqqqdddddddbqqqqqqqa
brrrrddddddbrrrrrrra
bsssssdddddbsssssssa
bttttttddddbttttttta
buuuuuuudddbuuuuuuua
bvvvvvvvvddbvvvvvvva
bwwwwwwwwwdbwwwwwwwa
bbbbbbbbbbbbbbbbbbbb
 10 10 2
baaaaaaaaa
bffacffffa
bggaccggga
bbbSccchha
bdddddccia
bjddccccca
bkkdddTaaa
blllddblla
bmmmmdbmma
bbbbbbbbbb
 15 3 4
llv
ttT
hbo
ogc
kfe
gli
fbx
kfp
spm
cxc
ndw
Soa
pfh
edr
xmv
 3 4 2
Sbbb
aabT
abbc
 5 10 4
aaaaaaaaaa
aaaaaTaaaa
aaaaaaaSaa
aaaaaaaaaa
aaaaaaaaaa
 10 20 3
baaaaaaaaaaaaaaaaaaa
bfffffffacfffffffffa
bgggggggaccgggggggga
bbbbbbbbSccchhhhhhha
biiiiidddddcciiiiiia
bjjjjjjddcccccjjjjja
bkkkkkkkdddTaaaaaaaa
bllllllllddbllllllla
bmmmmmmmmmdbmmmmmmma
bbbbbbbbbbbbbbbbbbbb
 1 2 4
ST
 20 10 4
baaaaaaaaa
bffacffffa
bggaccggga
bhhaccchha
biiaccccia
bjjaccccca
bkkakkkkka
bllallllla
bbbSmmmmma
bnnnnnnnna
booooooooa
bpppppTaaa
bqqqqqbqqa
brrrrrbrra
bdddddbssa
btddddbtta
buudddbuua
bvvvddbvva
bwwwwdbwwa
bbbbbbbbbb
 15 10 4
sejwprqjku
pnjsiopxft
rsplgvwixq
endglkchxl
ftihbbexgh
sxtxbbavge
jcdkusfnmr
skgsqvflia
kcxmcxjpae
amaiwcfile
njgjSunmwd
ldxvahgreu
ecmrajbjuT
naioqigols
pbwrmxkltj
 4 5 3
abaaa
babaT
Sabba
aaaaa
 1 2 1
ST
 2 1 1
S
T
 1 20 3
acbccbbddbffScTadffd

bbbcccaccaac
 -1
 aaca
 bbbbee
 -1
 aacccaa
 bb
 bbbc
 aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
 cbqb
 aaa
 -1
 -1
 a
 aa
 ccccc
 ccccc
 -1
 aab
 aa
 ccccc
 mmmno
 aajbju
 aaba
 c

#include <bits/stdc++.h>
using namespace std;
const int LIM = 50;
const int MAX_BIT = 26;
const int MAX_MASK = 1 << MAX_BIT;
string f[LIM], ans = "";
int used = 0;
bool us[LIM][LIM];
pair<int, int> p[LIM][LIM];
int n, m, k;
int si, sj, fi, fj;
vector<pair<int, int>> edges[LIM][LIM];
int di[] = {-1, 1, 0, 0}, dj[] = {0, 0, -1, 1};
bool bit(const int mask, const int b) { return (mask >> b) & 1; }
int cnt_bits(const int mask) {
  int res = 0;
  for (int i = 0; i < MAX_BIT; ++i) res += bit(mask, i);
  return res;
}
void get_next(int& mask, const int k) {
  if (cnt_bits(mask) < k) {
    ++mask;
  } else {
    for (int i = 0; i < MAX_BIT; ++i)
      if (bit(mask, i)) {
        mask += (1 << i);
        return;
      }
  }
}
void init_edges() {
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < m; ++j) {
      for (int id = 0; id < 4; ++id)
        if (i + di[id] >= 0 && i + di[id] < n && j + dj[id] >= 0 &&
            j + dj[id] < m && f[i + di[id]][j + dj[id]] == 'T')
          edges[i][j].push_back(make_pair(i + di[id], j + dj[id]));
      for (char c = 'a'; c <= 'z'; ++c)
        for (int id = 0; id < 4; ++id)
          if (i + di[id] >= 0 && i + di[id] < n && j + dj[id] >= 0 &&
              j + dj[id] < m && f[i + di[id]][j + dj[id]] == c)
            edges[i][j].push_back(make_pair(i + di[id], j + dj[id]));
    }
}
void show(int mask) {
  for (int i = 0; i < MAX_BIT; ++i)
    if (bit(mask, i)) cout << (char)('a' + i);
  cout << endl;
}
string get_res(int i, int j) {
  string res = "";
  while (i != -1) {
    res += f[i][j];
    int ni = p[i][j].first;
    j = p[i][j].second;
    i = ni;
  }
  reverse(res.begin(), res.end());
  return res;
}
string bfs(int mask) {
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < m; ++j) {
      us[i][j] = false;
    }
  p[si][sj] = make_pair(-1, -1);
  us[si][sj] = true;
  queue<pair<int, int>> q;
  q.push(make_pair(si, sj));
  while (!q.empty()) {
    int i = q.front().first, j = q.front().second;
    q.pop();
    for (int id = 0; id < (int)edges[i][j].size(); ++id) {
      int ni = edges[i][j][id].first, nj = edges[i][j][id].second;
      if ((f[ni][nj] == 'T' || bit(mask, f[ni][nj] - 'a')) && !us[ni][nj]) {
        p[ni][nj] = make_pair(i, j);
        us[ni][nj] = true;
        q.push(make_pair(ni, nj));
      }
    }
    if (us[fi][fj]) break;
  }
  if (!us[fi][fj]) return "";
  string res = "";
  for (int id = 0; id < 4; ++id)
    if (fi + di[id] >= 0 && fi + di[id] < n && fj + dj[id] >= 0 &&
        fj + dj[id] < m && us[fi + di[id]][fj + dj[id]]) {
      string tres = get_res(fi + di[id], fj + dj[id]);
      if (res == "")
        res = tres;
      else
        res = min(res, tres);
    }
  return res;
}
int main() {
  cin >> n >> m >> k;
  for (int i = 0; i < n; ++i) cin >> f[i];
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < m; ++j) {
      used |= (1 << (f[i][j] - 'a'));
      if (f[i][j] == 'S') {
        si = i;
        sj = j;
      }
      if (f[i][j] == 'T') {
        fi = i;
        fj = j;
      }
    }
  init_edges();
  int mask = 0;
  while (mask < MAX_MASK) {
    get_next(mask, k);
    string tans = bfs(mask);
    if (tans != "") {
      if (ans == "") {
        ans = tans;
      } else {
        if (ans.length() > tans.length())
          ans = tans;
        else if (ans.length() == tans.length())
          ans = min(ans, tans);
      }
    }
  }
  if (ans == "") {
    cout << -1;
  } else {
    for (int i = 1; i < (int)ans.length(); ++i) cout << ans[i];
  }
  return 0;
}
