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.*;
import java.util.*;

public class s72_e {
    public static void main(String[] args) throws IOException {
        new s72_e().run();
    }

    int nextInt() throws IOException {
        in.nextToken();
        return (int) in.nval;
    }

    String nextString() throws IOException {
        in.nextToken();
        return (String) in.sval;
    }

    StreamTokenizer in;
    Writer writer;
    Reader reader;
    Queue<Result> paths;
    int k, n, m, startX, startY, endX, endY, min;
    char[][] arr;
    boolean[] coverage = new boolean[27];
    void gen(int start, int len, String father) {
        if (len == k) {
            solve(father);
            return;
        }
        for (int i = start; i < 26; i++) {
                if (let.contains((char)(i+'a')))
                    gen(i + 1, len + 1, father + ((char)(i+'a')));

        }
    }
    Set<String> set = new HashSet<String>();
    private void solve(String father) {
        Queue<Node> queue = new PriorityQueue<Node>();

        queue.add(new Node(startX, startY, ""));
        // up, down, right, left
        int[] dx = {-1, 1, 0, 0};
        int[] dy = {0, 0, 1, -1};

        int[][] visited = new int[n][m];
        for (int i = 0; i < n; i++)
            Arrays.fill(visited[i], Integer.MAX_VALUE);

        while(!queue.isEmpty()) {
            Node node = queue.poll();

            if (node.x == endX && node.y == endY) {
                if (node.string.length() < min) {
                    min = node.string.length();
                    set.clear();
                    paths.clear();
                    if (!set.contains(node.string)){
                        addPath(node);
                        set.add(node.string);
                    }
                }
                if (node.string.length() == min && !set.contains(node.string)){
                        addPath(node);
                        set.add(node.string);
                }
            } else {
                if (visited[node.x][node.y] < node.string.length()) continue;

                visited[node.x][node.y] = node.string.length();
                for (int i = 0; i < dx.length; i++) {
                    int newY = dy[i] + node.y;
                    int newX = dx[i] + node.x;
                    if ( newX < n  && newX > -1 && newY < m && newY > -1 && arr[newX][newY]!='S' &&
                         visited[newX][newY] > node.string.length() &&
                         (arr[newX][newY] == 'T' || father.contains(arr[newX][newY]+"")) ) {
                                char we = arr[newX][newY] == 'T' ? ' ' : arr[newX][newY];
                                    Node nn =  new Node(newX, newY, node.string + we);
                                    queue.add(nn);
                    }
                }
            }
        }
    }
    Set<Character> let = new HashSet<Character>();
    void run() throws IOException {
        boolean oj = System.getProperty("ONLINE_JUDGE") != null;
        reader = oj ? new InputStreamReader(System.in, "ISO-8859-1") : new FileReader("input/is72_e.txt");
        writer = new OutputStreamWriter(System.out, "ISO-8859-1");
        in = new StreamTokenizer(new BufferedReader(reader));
        PrintWriter out = new PrintWriter(writer);
        n = nextInt();
        m = nextInt();
        k = nextInt();

        arr = new char[n][m];
        min = Integer.MAX_VALUE;
        paths = new PriorityQueue<Result>();
        for (int i = 0; i < n; i++) {
            String s = nextString();
            arr[i] = s.toCharArray();
            int startIndex = s.indexOf("S");
            int endIndex = s.indexOf("T");
            if (startIndex > -1) {
                startX = i;
                startY = startIndex;
            }
            if (endIndex > -1) {
                endX = i;
                endY = endIndex;
            }
            for (Character ch :arr[i])
                if (ch != 'T' && ch != 'S')
                    let.add(ch);
        }

        gen(0, 0, "");

        out.print(paths.size() == 0?-1:paths.poll().str);
        out.flush();
        out.close();
    }

    private void addPath(Node node) {
        paths.add(new Result(node.string));
    }
    class Result implements Comparable{
        String str ;
        Result(String str) {
            this.str = str;
        }
        public int compareTo(Object o) {
            Result r = (Result)o;
            if (str.length() < r.str.length()) return - 1;
            if (str.length() > r.str.length()) return 1;
            for (int i = 0; i < str.length(); i++) {
                if (str.charAt(i) < r.str.charAt(i)) return -1;
                if (str.charAt(i) > r.str.charAt(i)) return 1;
            }
            return 0;
        }
    }
    class Node implements Comparable{
        Node(int x, int y, String string) {
            this.x = x;
            this.y = y;
            this.string = string;
        }
        String string;
        int x, y;

        public int compareTo(Object o) {
            Node n = (Node)o;
            if (this.string.length() < n.string.length()) return -1;
            if (this.string.length() > n.string.length()) return 1;
            return 0;
        }
    }
}