Problem: You are working for an amusement park as an operator of an obakeyashiki, or a haunted house, in which guests walk through narrow and dark corridors. The house is proud of their lively ghosts, which are actually robots remotely controlled by the operator, hiding here and there in the corridors. One morning, you found that the ghosts are not in the positions where they are supposed to be. Ah, yesterday was Halloween. Believe or not, paranormal spirits have moved them around the corridors in the night. You have to move them into their right positions before guests come. Your manager is eager to know how long it takes to restore the ghosts.

In this problem, you are asked to write a program that, given a floor map of a house, finds the smallest number of steps to move all ghosts to the positions where they are supposed to be.

A floor consists of a matrix of square cells. A cell is either a wall cell where ghosts cannot move into or a corridor cell where they can.

At each step, you can move any number of ghosts simultaneously. Every ghost can either stay in the current cell, or move to one of the corridor cells in its 4-neighborhood (i.e. immediately left, right, up or down), if the ghosts satisfy the following conditions:

1. No more than one ghost occupies one position at the end of the step.
2. No pair of ghosts exchange their positions one another in the step.



For example, suppose ghosts are located as shown in the following (partial) map, where a sharp sign ('#) represents a wall cell and 'a', 'b', and 'c' ghosts.



ab#
c##



The following four maps show the only possible positions of the ghosts after one step.



ab#      a b#     acb#     ab #
c##      #c##     # ##     #c##





Input

The input consists of at most 10 datasets, each of which represents a floor map of a house. The format of a dataset is as follows.


w h n
c11c12...c1w
c21c22...c2w
. . ..       .
..           .
.
..           .
ch1ch2...chw


w, h and n in the first line are integers, separated by a space. w and h are the floor width and height of the house, respectively. n is the number of ghosts. They satisfy the following constraints.

4 ≤ w ≤ 16

4 ≤ h ≤ 16

1 ≤ n ≤ 3

Subsequent h lines of w characters are the floor map. Each of cij is either:

* a '#' representing a wall cell,
* a lowercase letter representing a corridor cell which is the initial position of a ghost,
* an uppercase letter representing a corridor cell which is the position where the ghost corresponding to its lowercase letter is supposed to be, or
* a space representing a corridor cell that is none of the above.



In each map, each of the first n letters from a and the first n letters from A appears once and only once. Outermost cells of a map are walls; i.e. all characters of the first and last lines are sharps; and the first and last characters on each line are also sharps. All corridor cells in a map are connected; i.e. given a corridor cell, you can reach any other corridor cell by following corridor cells in the 4-neighborhoods. Similarly, all wall cells are connected. Any 2 × 2 area on any map has at least one sharp. You can assume that every map has a sequence of moves of ghosts that restores all ghosts to the positions where they are supposed to be.

The last dataset is followed by a line containing three zeros separated by a space.

Output

For each dataset in the input, one line containing the smallest number of steps to restore ghosts into the positions where they are supposed to be should be output. An output line should not contain extra characters such as spaces.

Examples

Input

5 5 2
#####
#A#B#
#   #
#b#a#
#####
16 4 3
################
## ########## ##
#    ABCcba    #
################
16 16 3
################
### ##    #   ##
##  #  ##   # c#
#  ## ########b#
# ##  # #   #  #
#  # ##   # # ##
##  a#  # # #  #
### ## #### ## #
##   #   #  #  #
#  ##### # ## ##
####   #B# #   #
##  C#   #   ###
#  # # ####### #
# ######  A##  #
#        #    ##
################
0 0 0


Output

7
36
77


Input

5 5 2

A#B#

b#a#

16 4 3


ABCcba    #

16 16 3


c#
b#


a#  # # #  #



B# #   #
C#   #   ###

A##  #


0 0 0


Output

7
36
77

Solution (in CPP):

Solution:
#include <cstdio>
#include <queue>
#include <cstring>
#include <cctype>
#include <algorithm>
using namespace std;

const int INF = 1000;
const int MAX_W = 16;
const int dy[] = {1,-1,0,0,0}, dx[] = {0,0,1,-1,0};

int W, H, N;
int GY[3], GX[3], SY[3], SX[3];
char board[MAX_W][MAX_W + 1];
int distFromGoal[3][MAX_W][MAX_W];
unsigned short dist[MAX_W][MAX_W][MAX_W][MAX_W][MAX_W][MAX_W];

struct State {
	unsigned short dist;
	int y[3], x[3];

	State(){}
	State(unsigned short dist, int y_[3], int x_[3]):
		dist(dist)
	{
		memcpy(y, y_, sizeof(y));
		memcpy(x, x_, sizeof(x));
	}
};

bool operator> (const State& lhs, const State& rhs) {
	return lhs.dist > rhs.dist;
}

inline int getDist(int y0, int x0, int id) {
	return distFromGoal[id][y0][x0];
}

inline int getDist(int y[3], int x[3]) {
	int ans = 0;
	for (int i = 0; i < N; ++i) {
		ans = max(ans, getDist(y[i], x[i], i));
	}
	return ans;
}

bool init() {
	scanf("%d%d%d ", &W, &H, &N);
	for (int i = 0; i < H; ++i ) {
		scanf("%[^\n]%*c", board[i]);
	}
	return H > 0;
}

void dfs(int y[3], int x[3], int ny[3], int nx[3], int depth, int d, priority_queue<State, vector<State>, greater<State> > &que) {
	if (depth == N) {
		for (int i = 0; i < N; ++i) {
			for (int j = i + 1; j < N; ++j) {
				if (ny[i] == ny[j] && nx[i] == nx[j]) {
					return ;
				}
				if (y[i] == ny[j] && x[i] == nx[j] && y[j] == ny[i] && x[j] == nx[i]) {
					return ;
				}
			}
		}

		const int nd = d - getDist(y, x) + getDist(ny, nx) + 1;
		if (nd < dist[ny[0]][nx[0]][ny[1]][nx[1]][ny[2]][nx[2]]) {
			dist[ny[0]][nx[0]][ny[1]][nx[1]][ny[2]][nx[2]] = nd;
			que.push(State(nd, ny, nx));
		}

		return ;
	}
	for (int k = 0; k < 5; ++k) {
		ny[depth] = y[depth] + dy[k], nx[depth] = x[depth] + dx[k];
		if ( 0 <= ny[depth] && ny[depth] < H && 0 <= nx[depth] && nx[depth] < W && board[ny[depth]][nx[depth]] != '#') {
			dfs(y, x, ny, nx, depth + 1, d, que);
		}
	}
}


int solve() {
	
	memset(GY, 0, sizeof(GY));
	memset(GX, 0, sizeof(GX));
	memset(SY, 0, sizeof(SY));
	memset(SX, 0, sizeof(SX));
	for (int i = 0; i < H; ++i) {
		for (int j = 0; j < W; ++j) {
			if (isupper(board[i][j])) {
				const int id = board[i][j] - 'A';
				GY[id] = i;
				GX[id] = j;
				board[i][j] = ' ';
			}
			if (islower(board[i][j])) {
				const int id = board[i][j] - 'a';
				SY[id] = i;
				SX[id] = j;
				board[i][j] = ' ';
			}
		}
	}

	
	for (int k = 0; k < N; ++k) {
		for (int i = 0; i < H; ++i) {
			fill(distFromGoal[k][i], distFromGoal[k][i] + W, INF);
		}
	}
	for (int i = 0; i < N; ++i) {
		queue<pair<int,int> > que;
		que.push(make_pair(GY[i], GX[i]));
		distFromGoal[i][GY[i]][GX[i]] = 0;
		for (;!que.empty();) {
			pair<int,int> tp = que.front(); que.pop();
			const int y = tp.first, x = tp.second;
			for (int k = 0; k < 4; ++k) {
				const int ny = y + dy[k], nx = x + dx[k];
				if ( 0 <= ny && ny < H && 0 <= nx && nx < W && board[ny][nx] != '#' && distFromGoal[i][ny][nx] == INF) {
					distFromGoal[i][ny][nx] = distFromGoal[i][y][x] + 1;
					que.push(make_pair(ny, nx));
				}
			}
		}
	}

	
	memset(dist, ~0, sizeof(dist));
	priority_queue<State, vector<State>, greater<State> > que;
	int initValue = getDist(SY, SX);
	que.push(State(initValue, SY, SX));
	dist[SY[0]][SX[0]][SY[1]][SX[1]][SY[2]][SX[2]] = initValue;

	for (;!que.empty();) {
		State tp = que.top(); que.pop();
		int y[3], x[3];
		memcpy(y, tp.y, sizeof(y));
		memcpy(x, tp.x, sizeof(x));
		if (dist[y[0]][x[0]][y[1]][x[1]][y[2]][x[2]] < tp.dist) {
			continue;
		}

		{
			bool cut = true;
			for (int i = 0; i < N; ++i) {
				for (int j = 0; j < N; ++j) if (i != j) {
					cut &= distFromGoal[i][y[i]][x[i]] < distFromGoal[i][y[j]][x[j]];
				}
			}
			if (cut) {
				return int(tp.dist);
			}
		}

		
		int ny[3], nx[3];
		memcpy(ny, tp.y, sizeof(ny));
		memcpy(nx, tp.x, sizeof(nx));
		dfs(y, x, ny, nx, 0, tp.dist, que);
	}

	return 0;
}

int main() {
	for (;init();) {
		printf("%d\n", solve());
	}
	return 0;
}