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.InputStreamReader;
import java.util.LinkedList;
import java.util.PriorityQueue;
import java.util.Queue;

public class Track {
	char[][] arr;

	public void run() {
		try {
			BufferedReader in = new BufferedReader(new InputStreamReader(
					System.in));
			String[] sp = in.readLine().split("[ ]+");
			n = new Integer(sp[0]);
			m = new Integer(sp[1]);
			k = new Integer(sp[2]);
			sx = -1;
			sy = -1;
			ex = -1;
			ey = -1;
			arr = new char[n][m];
			for (int i = 0; i < n; i++) {
				arr[i] = in.readLine().toCharArray();
				for (int j = 0; j < arr[i].length; j++) {
					if (arr[i][j] == 'S') {
						sx = i;
						sy = j;
					}
					if (arr[i][j] == 'T') {
						ex = i;
						ey = j;
					}
				}
			}
			dfs(0,0,new boolean[26]);
			if(min==1<<25)System.out.println(-1);else
			System.out.println(sol.substring(0,sol.length()-1));
			
		} catch (Exception e) {
			e.printStackTrace();
		}
	}

	public void dfs(int i, int count, boolean[] chars) {
		if (count == k) {
			String temp = "";
			for (int j = 0; j < 26; j++) {
				if (chars[j]) {
					char x = (char) ('a' + j);
					temp += x;
				}
			}
			bfs(temp + "T");
			return;
		}
		if (i == 26)
			return;
		dfs(i + 1, count, chars);
		chars[i] = true;
		dfs(i + 1, count + 1, chars);
		chars[i] = false;
	}

	class State implements Comparable<State>{
		int x, y, cost;

		String path;

		public State(int xx, int yy, int cc, String pp) {
			x = xx;
			y = yy;
			cost = cc;
			path = pp;
		}

		@Override
		public int compareTo(State arg0) {
			return path.compareTo(arg0.path);
		}
	}

	String sol = "";
	int min=1<<25;
	public void bfs(String can) {
		boolean[][] vis = new boolean[n][m];
//		vis[sx][sy] = true;
		PriorityQueue<State> q = new PriorityQueue<State>();
		q.add(new State(sx, sy, 0, ""));
		while (!q.isEmpty()) {
			State front = q.remove();
//			System.out.println(front.x+" "+front.y);
			if(vis[front.x][front.y])continue;
			vis[front.x][front.y]=true;
			if (front.x == ex && front.y == ey) {
//				System.out.println(front.path);
				if (sol.compareTo("") == 0){
					sol = front.path;
					min=sol.length();
				}
				else if (front.path.compareTo(sol) < 0) {
					sol = front.path;
					min=sol.length();
				}
				
			}
			for (int i = 0; i < 4; i++) {
				int nx = front.x + dx[i];
				int ny = front.y + dy[i];
				if (valid(nx, ny) && !vis[nx][ny]
						&& can.contains("" + arr[nx][ny])) {
//					vis[nx][ny] = true;
					q.add(new State(nx, ny, front.cost + 1, front.path + arr[nx][ny]));
				}
			}
		}
	}

//	private int bfs(int sx, int sy) {
//		boolean[][][][][] vis = new boolean[n][m][k + 1][n][m];
//		for (int i = 0; i < k; i++)
//			for (int j = 0; j < n; j++)
//				for (int k = 0; k < m; k++)
//					vis[sx][sy][i][j][k] = true;
//		Queue<State> q = new LinkedList<State>();
//		q.offer(new State(sx, sy, 0, 0, (char) ('z' + 1), ""));
//		while (!q.isEmpty()) {
//			State front = q.remove();
//
//			if (front.x == ex && front.y == ey) {
//
//				if (min == 1 << 25) {
//					min = front.cost;
//					sol = front.path;
//				} else if (min == front.cost) {
//					if (front.path.compareTo(sol) < 0) {
//						sol = front.path;
//					}
//				}
//				continue;
//			}
//			for (int i = 0; i < 4; i++) {
//				int nx = front.x + dx[i];
//				int ny = front.y + dy[i];
//
//				if (valid(nx, ny)) {
//					int difS = front.sq;
//					if (arr[nx][ny] != '|' && arr[nx][ny] != front.last)
//						difS++;
//					if (arr[nx][ny] == '|' || difS <= k
//							&& !vis[nx][ny][difS][front.x][front.y]) {
//						vis[nx][ny][difS][front.x][front.y] = true;
//						q.offer(new State(nx, ny, difS, front.cost + 1,
//								arr[nx][ny], front.path + arr[nx][ny]));
//
//					}
//				}
//			}
//		}
//		return -1;
//	}

	int[] dx = { 1, -1, 0, 0 };
	int[] dy = { 0, 0, 1, -1 };
	int n, m, k, ex, ey, sx, sy;

	private boolean valid(int i, int j) {
		return i >= 0 && i < arr.length && j >= 0 && j < arr[0].length;
	}

	public static void main(String[] args) {
		new Track().run();
	}
}
