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

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;

public class C {

    static BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
    static StringTokenizer st;
    static PrintWriter out = new PrintWriter(System.out);
    
    static String nextToken() throws IOException{
        while (st==null || !st.hasMoreTokens()){
            String s = bf.readLine();
            if (s == null)
                return null;
            st = new StringTokenizer(s);
        }
        
        return st.nextToken();
    }
    
    static int nextInt() throws IOException{
        return Integer.parseInt(nextToken());
    }
    
    static long nextLong() throws IOException{
        return Long.parseLong(nextToken());
    }
    
    static String nextStr() throws IOException{
        return nextToken();
    }
    
    static double nextDouble() throws IOException{
        return Double.parseDouble(nextToken());
    }
    
    static int n, m;
    static byte a[][];
    static int prevx[][], prevy[][];
    static int ax[] = new int[3000];
    static int ay[] = new int[3000];
    static byte chars[] = new byte[256];
    static String min = "-1";
    
    static void count(int x, int y){
        String res = "";
        while (a[x][y] != 'S'){
            res = (char)a[x][y]+res;
            int X = x,
                Y = y;
            x = prevx[X][Y];
            y = prevy[X][Y];
        }
        
        if (min.compareTo("-1")==0 || res.length()<min.length() || res.length()==min.length() && res.compareTo(min)<0)
            min = res;
    }
    
    static void bfs(int fromx[], int fromy[], int tox[], int toy[], int k){
        int r = 0;
        
        int p = 0;
        for (int q=0; q<k; q++){
            int x = fromx[q],
                y = fromy[q];
            
            if (x>0 && a[x-1][y]=='T'){
                count(x, y);
                return;
            }
            if (x<n-1 && a[x+1][y]=='T'){
                count(x, y);
                return;
            }
            if (y>0 && a[x][y-1]=='T'){
                count(x, y);
                return;
            }
            if (y<m-1 && a[x][y+1]=='T'){
                count(x, y);
                return;
            }
            
            if (x>0 && chars[a[x-1][y]]==1 && prevx[x-1][y]==-1){
                prevx[x-1][y] = x;
                prevy[x-1][y] = y;
                ax[p] = x-1;
                ay[p] = y;
                p++;
            }
            if (x<n-1 && chars[a[x+1][y]]==1 && prevx[x+1][y]==-1){
                prevx[x+1][y] = x;
                prevy[x+1][y] = y;
                ax[p] = x+1;
                ay[p] = y;
                p++;
            }
            if (y>0 && chars[a[x][y-1]]==1 && prevx[x][y-1]==-1){
                prevx[x][y-1] = x;
                prevy[x][y-1] = y;
                ax[p] = x;
                ay[p] = y-1;
                p++;
            }
            if (y<m-1 && chars[a[x][y+1]]==1 && prevx[x][y+1]==-1){
                prevx[x][y+1] = x;
                prevy[x][y+1] = y;
                ax[p] = x;
                ay[p] = y+1;
                p++;
            }
            
            
                
        }
        
        for (int i=0; i<p; i++)
            for (int j=i+1; j<p; j++)
                if (a[ax[i]][ay[i]] > a[ax[j]][ay[j]]){
                    int t = ax[i]; ax[i] = ax[j]; ax[j] = t;
                        t = ay[i]; ay[i] = ay[j]; ay[j] = t;
                }
        
        for (int i=0; i<p; i++){
            tox[r] = ax[i];
            toy[r] = ay[i];
            r++;
        }
        
        if (r != 0)
            bfs(tox, toy, fromx, fromy, r);
    }
    
    public static void main(String[] args) throws IOException{
        n = nextInt();
        m = nextInt();
        int k = nextInt();
        
        a = new byte[n][];
        prevx = new int[n][m];
        prevy = new int[n][m];
        for (int i=0; i<n; i++)
            a[i] = nextStr().getBytes();
        
        int fromx[] = new int[n*m];
        int fromy[] = new int[n*m];
        int tox[] = new int[n*m];
        int toy[] = new int[n*m];
        
        int x = 0, y = 0;
        for (int i=0; i<n; i++)
            for (int j=0; j<m; j++)
                if (a[i][j] == 'S'){
                    x = i;
                    y = j;
                }
        
        if (k == 1){
            for (int i='a'; i<='z'; i++){
                for (int z=0; z<n; z++){
                    Arrays.fill(prevx[z], -1);
                    Arrays.fill(prevy[z], -1);
                }
                Arrays.fill(chars, (byte)0);
                chars[i] = 1;
                fromx[0] = x;
                fromy[0] = y;
                bfs(fromx, fromy, tox, toy, 1);
            }
        }
        
        if (k == 2){
            for (int i='a'; i<='z'; i++)
                for (int j=i+1; j<='z'; j++){
                    for (int z=0; z<n; z++){
                        Arrays.fill(prevx[z], -1);
                        Arrays.fill(prevy[z], -1);
                    }
                    Arrays.fill(chars, (byte)0);
                    chars[i] = 1;
                    chars[j] = 1;
                    fromx[0] = x;
                    fromy[0] = y;
                    bfs(fromx, fromy, tox, toy, 1);
                }
        }
        
        if (k == 3){
            for (int i='a'; i<='z'; i++)
                for (int j=i+1; j<='z'; j++)
                    for (int t=j+1; t<='z'; t++){
                        
                        for (int z=0; z<n; z++){
                            Arrays.fill(prevx[z], -1);
                            Arrays.fill(prevy[z], -1);
                        }
                        Arrays.fill(chars, (byte)0);
                        chars[i] = 1;
                        chars[j] = 1;
                        chars[t] = 1;
                        fromx[0] = x;
                        fromy[0] = y;
                        bfs(fromx, fromy, tox, toy, 1);
                    }
                    
        }
        
        if (k == 4){
            for (int i='a'; i<='z'; i++)
                for (int j=i+1; j<='z'; j++)
                    for (int t=j+1; t<='z'; t++)
                        for (int q=t+1; q<='z'; q++){
                            for (int z=0; z<n; z++){
                                Arrays.fill(prevx[z], -1);
                                Arrays.fill(prevy[z], -1);
                            }
                            Arrays.fill(chars, (byte)0);
                            chars[i] = 1;
                            chars[j] = 1;
                            chars[t] = 1;
                            chars[q] = 1;
                            fromx[0] = x;
                            fromy[0] = y;
                            bfs(fromx, fromy, tox, toy, 1);
                        }
                    
        }
        
        out.println(min);
        out.flush();

    }

}
