Problem: It was the last day of the summer camp you strayed into the labyrinth on the way to Komaba Campus, the University of Tokyo. The contest has just begun. Your teammates must impatiently wait for you. So you have to escape from this labyrinth as soon as possible.
The labyrinth is represented by a grid map. Initially, each grid except for walls and stairs is either on the first floor or on the second floor. Some grids have a switch which can move up or down some of the grids (the grids on the first floor move to the second floor, and the grids on the second floor to the first floor).
In each step, you can take one of the following actions:


* Move to an adjacent grid (includes stairs) on the same floor you are now in.

* Move to another floor (if you are in the stairs grid).

* Operate the switch (if you are in a grid with a switch).




Luckily, you have just found a map of the labyrinth for some unknown reason. Let's calculate the minimum step to escape from the labyrinth, and go to the place your teammates are waiting!



Input

The format of the input is as follows.


> W H
> M11M12M13...M1W
> M21M22M23...M2W
> ........
> MH1MH2MH3...MHW
> S
> MS111MS112MS113...MS11W
> MS121MS122MS123...MS12W
> ........
> MS1H1MS1H2MS1H3...MS1HW
> MS211MS212MS213...MS21W
> MS221MS222MS223...MS22W
> ........
> MS2H1MS2H2MS2H3...MS2HW
> MSS11MSS12MSS13...MSS1W
> MSS21MSS22MSS23...MSS2W
> ........
> MSSH1MSSH2MSSH3...MSSHW
>

The first line contains two integers W (3 ≤ W ≤ 50) and H (3 ≤ H ≤ 50). They represent the width and height of the labyrinth, respectively.
The following H lines represent the initial state of the labyrinth. Each of Mij is one of the following symbols:


* '#' representing a wall,
* '|' representing stairs,
* '_' representing a grid which is initially on the first floor,
* '^' representing a grid which is initially on the second floor,
* a lowercase letter from 'a' to 'j' representing a switch the grid has, and the grid is initially on the first floor,
* an uppercase letter from 'A' to 'J' representing a switch the grid has, and the grid is initially on the second floor,
* '%' representing the grid you are initially in (which is initially on the first floor) or
* '&' representing the exit of the labyrinth (which is initially on the first floor).



The next line contains one integer S (0 ≤ S ≤ 10), and then the following SH lines represent the information of the switches. Each of MSkij is one of:


* '#' if Mij is a '#',
* '|' if Mij is a '|',
* '*' if the grid is moved by the switch represented by the k-th alphabet letter, or
* '.' otherwise.



Note that the grid which contains a switch may be moved by operating the switch. In this case, you will move together with the grid.
You may assume each of the '%' (start) and '&' (goal) appears exacyly once, that the map is surround by walls, and that each alphabet in the map is any of the letters from 'A' (or 'a') to S-th alphabet letter.

Output

Print the minimum step to reach the goal in one line. If there is no solution, print "-1".

Examples

Input

6 6
######
#_|A%#
#B#_|#
#^BBa#
#B&A##
######
2
######
#*|*.#
#.#.|#
#*.**#
#...##
######
######
#*|*.#
#*#.|#
#..**#
#..*##
######


Output

21


Input

6 6

_|A%#
B#_|#
^BBa#
B&A##

2

*|*.#
.#.|#
*.**#
...##


*|*.#
*#.|#
..**#
..*##


Output

21


Input

8 3

%||Aa&#

2

*||*..#


.||*.*#


Output

7


Input

3 4

%#
&#

0


Output

1


Input

3 5

%#
^#
&#

0


Output

-1

Solution (in CPP):

Solution:
#include <bits/stdc++.h>

#ifdef LOCAL
#include "dump.hpp"
#else
#define dump(...)
#endif

using namespace std;

#define REP(i, a, b) for(int i = (a); i < int(b); ++i)
#define rep(i, n) REP(i, 0, n)

constexpr int MAX_SIZE = 50;
constexpr int MAX_S = 10;

int w, h;
int sx, sy, gx, gy;

string field[MAX_SIZE];
bool initial_floar[MAX_SIZE][MAX_SIZE];
int match[MAX_SIZE][MAX_SIZE];
int dist[MAX_SIZE][MAX_SIZE][2][1 << MAX_S];

bool get_floor(int x, int y, int s) {
	return (__builtin_popcount(match[y][x] & s) + initial_floar[y][x]) & 1;
}

int bfs() {
	typedef tuple<int, int, bool, int> state; // x, y, floor, switch state
	constexpr int dx[] = {1, 0, -1, 0};
	constexpr int dy[] = {0, 1, 0, -1};

	queue<state> que;
	fill_n((int *)dist, sizeof(dist) / sizeof(int), INT_MAX);
	dist[sy][sx][0][0] = 0;
	que.push(state(sx, sy, 0, 0));

	while(!que.empty()) {
		int x, y, s;
		bool f;
		tie(x, y, f, s) = que.front();
		que.pop();

		const int &d = dist[y][x][f][s];

		dump(x, y, f, s, d);

		if(field[y][x] == '|') {
			if(dist[y][x][!f][s] > d + 1) {
				dist[y][x][!f][s] = d + 1;
				que.push(state(x, y, !f, s));
			}
		}

		if(islower(field[y][x])) {
			const int next_s = s ^ (1 << (field[y][x] - 'a'));
			const bool next_f = get_floor(x, y, next_s);

			if(dist[y][x][next_f][next_s] > d + 1) {
				dist[y][x][next_f][next_s] = d + 1;
				que.push(state(x, y, next_f, next_s));
			}
		}

		rep(dir, 4) {
			const int nx = x + dx[dir];
			const int ny = y + dy[dir];

			if(field[ny][nx] == '#') continue;
			if(field[ny][nx] != '|' && f != get_floor(nx, ny, s)) continue;

			if(dist[ny][nx][f][s] > d + 1) {
				if(nx == gx && ny == gy) return d + 1;
				dist[ny][nx][f][s] = d + 1;
				que.push(state(nx, ny, f, s));
			}
		}
	}

	return -1;
}

int main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	cin >> w >> h;

	rep(i, h) {
		cin >> field[i];

		rep(j, w) {
			switch(field[i][j]) {
			case '%':
				sx = j;
				sy = i;
				break;
			case '&':
				gx = j;
				gy = i;
				break;
			case '^':
				initial_floar[i][j] = 1;
				break;
			default:
				if(isupper(field[i][j])) {
					initial_floar[i][j] = 1;
					field[i][j] = tolower(field[i][j]);
				}
			}
		}
	}

	int s;
	cin >> s;

	rep(k, s) {
		rep(i, h) {
			string row;
			cin >> row;

			rep(j, w) {
				if(row[j] == '*') {
					match[i][j] |= (1 << k);
				}
			}
		}
	}

	cout << bfs() << endl;

	return EXIT_SUCCESS;
}