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 Main implements Runnable {

	public void _main() throws IOException {
		n = nextInt();
		m = nextInt();
		k = nextInt();
		s = new char[n][];
		qr = new int[n * m];
		qc = new int[n * m];
		dist = new int[n][m];
		sr = sc = tr = tc = -1;
		for (int r = 0; r < n; r++) {
			s[r] = next().toCharArray();
			for (int c = 0; c < m; c++) {
				if (s[r][c] == 'S') {
					sr = r;
					sc = c;
				}
				if (s[r][c] == 'T') {
					tr = r;
					tc = c;
				}
			}
		}
		int sMask = 0, tMask = 0;
		for (int dir = 0; dir < 4; dir++) {
			int nr = sr + dr[dir];
			int nc = sc + dc[dir];
			if (nr < 0 || nr >= n || nc < 0 || nc >= m) {
				
			}
			else {
				if (s[nr][nc] == 'T')
					return;
				sMask |= 1 << (s[nr][nc] - 'a');
			}
			nr = tr + dr[dir];
			nc = tc + dc[dir];
			if (nr < 0 || nr >= n || nc < 0 || nc >= m) continue;
			tMask |= 1 << (s[nr][nc] - 'a');
		}
		rec(sMask, tMask, 0, 0, -1);
		out.println(res == null ? -1 : res);
	}

	int n, m, k;
	int sr, sc, tr, tc;
	char[][] s;
	int[] dr = {-1, 0, 1, 0};
	int[] dc = {0, -1, 0, 1};
	String res = null;
	int[] qr, qc;
	int[][] dist;
	
	private void rec(int sMask, int tMask, int allowed, int pos, int prev) {
		if (pos == k) {
			if ((allowed & sMask) == 0) return;
			if ((allowed & tMask) == 0) return;
			for (int[] arr : dist)
				Arrays.fill(arr, -1);
			int qt = 0, qh = 1;
			qr[0] = tr;
			qc[0] = tc;
			dist[tr][tc] = 0;
			while (qt < qh) {
				int r = qr[qt];
				int c = qc[qt];
				++qt;
				for (int dir = 0; dir < 4; dir++) {
					int nr = r + dr[dir];
					int nc = c + dc[dir];
					if (nr < 0 || nr >= n || nc < 0 || nc >= m) continue;
					if (s[nr][nc] != 'S' && ((allowed & (1 << (s[nr][nc] - 'a'))) == 0)) continue;
					if (dist[nr][nc] == -1) {
						dist[nr][nc] = 1 + dist[r][c];
						qr[qh] = nr;
						qc[qh] = nc;
						++qh;
					}
				}
			}
			if (dist[sr][sc] == -1 || (res != null && dist[sr][sc] - 1 > res.length())) return;
			StringBuilder sb = new StringBuilder();			
			qt = 0; qh = 1;
			qr[0] = sr;
			qc[0] = sc;
			int[][] prevRow = new int[n][m];
			int[][] prevCol = new int[n][m];
			char[][] prevChar = new char[n][m];
			for (int[] arr : prevRow)
				Arrays.fill(arr, -1);
			outer:
			while (qt < qh) {
				List<Edge> nextLevel = new ArrayList<Edge>();
				int needDist = dist[qr[qt]][qc[qt]];
				while (qt < qh) {
					int r = qr[qt];
					int c = qc[qt];
					if (dist[r][c] != needDist) break;
					++qt;
					for (int dir = 0; dir < 4; dir++) {
						int nr = r + dr[dir];
						int nc = c + dc[dir];
						if (nr < 0 || nr >= n || nc < 0 || nc >= m) continue;
						if (dist[nr][nc] + 1 == dist[r][c]) {
							nextLevel.add(new Edge(nr, nc, r, c, s[nr][nc]));
						}
					}
				}
				prevRow[sr][sc] = 0;
				Collections.sort(nextLevel);
				for (Edge edge : nextLevel) {
					int r = edge.r;
					int c = edge.c;
					if (prevRow[r][c] == -1) {
						prevRow[r][c] = edge.pr;
						prevCol[r][c] = edge.pc;
						prevChar[r][c] = edge.ch;
						qr[qh] = r;
						qc[qh] = c;
						++qh;
					}
					else {
						continue;
					}
					if (r == tr && c == tc) {
						while (r != sr || c != sc) {
							if (prevChar[r][c] != 'T')
								sb.append(prevChar[r][c]);
							int pr = prevRow[r][c];
							int pc = prevCol[r][c];
							r = pr;
							c = pc;					
						}
						break outer;
					}
				}
			}
			sb = sb.reverse();
			if (better(sb.toString(), res))
				res = sb.toString();
			return;
		}
		for (int i = prev + 1; i < 26; i++)
			rec(sMask, tMask, allowed | (1 << i), pos + 1, i);
	}
	
	class Edge implements Comparable<Edge> {
		char ch;
		int r, c, pr, pc;
		Edge(int r, int c, int pr, int pc, char ch) {
			this.r = r;
			this.c = c;
			this.pr = pr;
			this.pc = pc;
			this.ch = ch;
		}
		public int compareTo(Edge o) {
			return ch - o.ch;
		}
	}


	private boolean better(String a, String b) {
		if (b == null) return true;
		if (a.length() != b.length())
			return a.length() < b.length();
		return a.compareTo(b) < 0;
	}

	private BufferedReader in;
	private PrintWriter out;
	private StringTokenizer st;

	private String next() throws IOException {
		while (st == null || !st.hasMoreTokens()) {
			String rl = in.readLine();
			if (rl == null)
				return null;
			st = new StringTokenizer(rl);
		}
		return st.nextToken();
	}

	private int nextInt() throws IOException {
		return Integer.parseInt(next());
	}

	private long nextLong() throws IOException {
		return Long.parseLong(next());
	}

	private double nextDouble() throws IOException {
		return Double.parseDouble(next());
	}

	public static void main(String[] args) {
		Locale.setDefault(Locale.UK);
		new Thread(new Main()).start();
	}

	public void run() {
		try {
			in = new BufferedReader(new InputStreamReader(System.in));
			out = new PrintWriter(System.out);

			_main();

			out.close();
		} catch (Exception e) {
			e.printStackTrace();
			System.exit(202);
		}
	}

}
