#include <bits/stdc++.h>
using namespace std;

template<class T>
bool chmax(T& a, const T& b) {
    if (a < b) { a = b; return true; }
    return false;
}
template<class T>
bool chmin(T& a, const T& b) {
    if (b < a) { a = b; return true; }
    return false;
}

// std::vector Declaration
template<typename T>
vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

// std::vector Declaration and Initialization
template<typename T>
vector<T> make_vector(size_t a, T x) { return vector<T>(a, x); }
template<typename T, typename U, typename... Ts>
auto make_vector(size_t a, U b, Ts... ts) {
    return vector<decltype(make_vector<T>(b,ts...))>(a, make_vector<T>(b, ts...));
}

// std::vector Input
template<typename T>
istream& operator>>(istream& is, vector<T>& v) {
    for (auto &e : v) is >> e;
    return is;
}

// std::vector Debug
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "[";
    bool a = 1;
    for (auto e : v) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::array Debug
template<typename T, size_t n>
ostream& operator<<(ostream& os, const array<T, n>& v) {
    os << "[";
    bool a = 1;
    for (auto e : v) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::deque Debug
template<typename T>
ostream& operator<<(ostream& os, const deque<T>& d) {
    os << "[";
    bool a = 1;
    for (auto e : d) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::pair Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << " " << p.second << ")";
    return os;
}

// std::set Debug
template<typename T>
ostream& operator<<(ostream& os, const set<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::multiset Debug
template<typename T>
ostream& operator<<(ostream& os, const multiset<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::map Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const map<T, U>& mp) {
    os << "{";
    bool a = 1;
    for (auto e : mp) {
        os << (a ? "" : " ");
        os << e.first << ":" << e.second;
        a = 0;
    }
    os << "}";
    return os;
}

// std::tuple Debug
template<int N, class Tuple>
void out(ostream& os, const Tuple& t){}
template<int N, class Tuple, class H, class ...Ts>
void out(ostream& os, const Tuple& t) {
    if (N) os << " ";
    os << get<N>(t);
    out<N+1,Tuple,Ts...>(os, t);
}
template<class ...Ts>
ostream& operator<<(ostream& os, const tuple<Ts...>& t) {
    os << "(";
    out<0,tuple<Ts...>,Ts...>(os, t);
    os << ")";
    return os;
}

// Debug
#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl

// Weighted edge
template<typename T>
struct edge {
    int src, to;
    T cost;

    edge() {}
    edge(int to, T cost) : src(-1), to(to), cost(cost) {}
    edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}

    friend ostream& operator<<(ostream& os, const edge& e) {
        return os << "(" << e.src << "->" << e.to << ":" << e.cost << ")";
    }
};

using LL = int64_t;

#define fs first
#define sc second

const int64_t MOD = 1e9+7;

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);

    int W, H; cin >> W >> H;
    vector<string> M(H); cin >> M;
    int S; cin >> S;
    auto MS = make_v<string>(S, H); cin >> MS;

    auto Switch = make_vector<int>(H, W, -1),
         Floor = make_v<int>(H, W);
    auto Moved = make_v<int>(S, H, W);

    int si, sj, ti, tj;

    for (int i = 0; i < H; ++i) {
        for (int j = 0; j < W; ++j) {
            if (M[i][j] == '%') {
                si = i, sj = j;
            }
            if (M[i][j] == '&') {
                ti = i, tj = j;
            }
            if (M[i][j] == '^') {
                Floor[i][j] = 1;
            }
            if ('a' <= M[i][j] and M[i][j] < 'a' + S) {
                Switch[i][j] = M[i][j] - 'a';
            }
            if ('A' <= M[i][j] and M[i][j] < 'A' + S) {
                Switch[i][j] = M[i][j] - 'A';
                Floor[i][j] = 1;
            }
        }
    }
    // for (int i = 0; i < H; ++i) {
    //     DUMP(Switch[i]);
    // }
    // for (int i = 0; i < H; ++i) {
    //     DUMP(Floor[i]);
    // }

    for (int k = 0; k < S; ++k) {
        for (int i = 0; i < H; ++i) {
            for (int j = 0; j < W; ++j) {
                if (MS[k][i][j] == '*') {
                    Moved[k][i][j] = 1;
                }
            }
        }
    }
    // for (int k = 0; k < S; ++k) {
    //     for (int i = 0; i < H; ++i) {
    //         DUMP(Moved[k][i]);
    //     }
    //     cerr << endl;
    // }

    function<int(int,int,int)> getFloor = [&](int i, int j, int s) {
        int floor = Floor[i][j];
        for (int k = 0; k < S; ++k) if (s >> k & 1) {
            floor ^= Moved[k][i][j];
        }
        return floor;
    };

    int dy[] = {1, 0, -1, 0},
        dx[] = {0, -1, 0, 1};

    using State = tuple<int,int,int,int>;
    queue<pair<int,State>> que;
    que.emplace(0, make_tuple(si, sj, 0, 0));

    auto used = make_v<bool>(2, H, W, 1<<S);
    used[0][si][sj][0] = true;

    int ans = -1;

    while (!que.empty()) {
        int dist; State tp; tie(dist, tp) = que.front(); que.pop();
        int i, j, f, s; tie(i, j, f, s) = tp;

        if (i == ti and j == tj) {
            ans = dist;
            break;
        }

        // DUMP(i);
        // DUMP(j);
        // DUMP(f);
        // DUMP(dist);
        // DUMP(bitset<10>(s));
        // cerr << endl;

        if (Switch[i][j] != -1) {
            int ts = s ^ 1<<Switch[i][j];
            int nextFloor = getFloor(i, j, ts);
            if (!used[nextFloor][i][j][ts]) {
                que.emplace(dist + 1, make_tuple(i, j, nextFloor, ts));
                used[nextFloor][i][j][ts] = true;
            }
        }
        if (M[i][j] == '|') {
            if (!used[1-f][i][j][s]) {
                que.emplace(dist + 1, make_tuple(i, j, 1-f, s));
                used[1-f][i][j][s] = true;
            }
        }
        for (int t = 0; t < 4; ++t) {
            int y = i + dy[t], x = j + dx[t];
            if (M[y][x] == '#') {
                continue;
            }
            if (getFloor(y,x,s) != f and M[y][x] != '|') {
                continue;
            }
            if (!used[f][y][x][s]) {
                que.emplace(dist + 1, make_tuple(y, x, f, s));
                used[f][y][x][s] = true;
            }
        }
    }

    cout << ans << endl;

    return 0;
}



Measured memory_bytes: 4960