Problem: Alice has a computer that operates on w-bit integers. The computer has n registers for values. The current content of the registers is given as an array a_1, a_2, …, a_n. 

The computer uses so-called "number gates" to manipulate this data. Each "number gate" takes two registers as inputs and calculates a function of the two values stored in those registers. Note that you can use the same register as both inputs.

Each "number gate" is assembled from bit gates. There are six types of bit gates: AND, OR, XOR, NOT AND, NOT OR, and NOT XOR, denoted "A", "O", "X", "a", "o", "x", respectively. Each bit gate takes two bits as input. Its output given the input bits b_1, b_2 is given below:

\begin{matrix} b_1 & b_2 & A & O & X & a & o & x \\\ 0 & 0 & 0 & 0 & 0 & 1 & 1 & 1 \\\ 0 & 1 & 0 & 1 & 1 & 1 & 0 & 0 \\\ 1 & 0 & 0 & 1 & 1 & 1 & 0 & 0 \\\ 1 & 1 & 1 & 1 & 0 & 0 & 0 & 1 \\\ \end{matrix} 

To build a "number gate", one takes w bit gates and assembles them into an array. A "number gate" takes two w-bit integers x_1 and x_2 as input. The "number gate" splits the integers into w bits and feeds the i-th bit of each input to the i-th bit gate. After that, it assembles the resulting bits again to form an output word. 

For instance, for 4-bit computer we might have a "number gate" "AXoA" (AND, XOR, NOT OR, AND). For two inputs, 13 = 1101_2 and 10 = 1010_2, this returns 12 = 1100_2, as 1 and 1 is 1, 1 xor 0 is 1, not (0 or 1) is 0, and finally 1 and 0 is 0. 

You are given a description of m "number gates". For each gate, your goal is to report the number of register pairs for which the "number gate" outputs the number 0. In other words, find the number of ordered pairs (i,j) where 1 ≤ i,j ≤ n, such that w_k(a_i, a_j) = 0, where w_k is the function computed by the k-th "number gate".

Input

The first line contains three integers: w, n, and m~(1 ≤ w ≤ 12, 1 ≤ n ≤ 3⋅ 10^4, 1 ≤ m ≤ 5⋅ 10^4) — the word size, the number of variables, and the number of gates.

The second line contains n integers a_1, a_2, …, a_n (0 ≤ a_i < 2^w) — the value of variables stored in the registers.

Each of the next m lines contains a string g_j~(|g_j| = w) with a description of a single gate. Each character of g_j is one of "A", "O", "X", "a", "o", "x".

Output

Print m lines. The i-th line should contain the number of ordered pairs of variables for which the i-th gate returns zero.

Examples

Input

4 3 1
13 10 6
AXoA


Output

3


Input

1 7 6
0 1 1 0 1 0 0
A
O
X
a
o
x


Output

40
16
25
9
33
24


Input

6 2 4
47 12
AOXaox
AAaaAA
xxxxxx
XXXXXX


Output

2
3
0
2


Input

2 2 2
2 0
xO
Ox


Output

2
0

Note

In the first test case, the inputs in binary are 1101, 1010, 0110. The pairs that return 0 are (13, 6), (6, 13), and (6, 6). As it was already mentioned in the problem statement, 13 ⊕ 10 = 10 ⊕ 13 = 12. The other pairs are 13 ⊕ 13 = 11, 10 ⊕ 10 = 8 and 10 ⊕ 6 = 6 ⊕ 10 = 4. 

Solution (in JAVA):

Solution:
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.FilterInputStream;
import java.io.BufferedInputStream;
import java.io.InputStream;

/**
 * @author khokharnikunj8
 */

public class Main {
    public static void main(String[] args) {
        new Thread(null, new Runnable() {
            public void run() {
                new Main().solve();
            }
        }, "1", 1 << 26).start();
    }

    void solve() {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        ScanReader in = new ScanReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        FBooleanComputer solver = new FBooleanComputer();
        solver.solve(1, in, out);
        out.close();
    }

    static class FBooleanComputer {
        long ans = 0;
        long[] cnt1;
        char[] ar;
        int[] pow;
        int w;

        private void findIt(int i, int cur) {
            if (i < 0) ans += cnt1[cur];
            else {
                if (ar[i] == 'A') {
                    findIt(i - 1, cur + pow[w - i - 1] * 0);
                    findIt(i - 1, cur + pow[w - i - 1] * 1);
                } else if (ar[i] == 'O') {
                    findIt(i - 1, cur + pow[w - i - 1] * 0);
                } else if (ar[i] == 'X') {
                    findIt(i - 1, cur + pow[w - i - 1] * 0);
                    findIt(i - 1, cur + pow[w - i - 1] * 2);
                } else if (ar[i] == 'a') {
                    findIt(i - 1, cur + pow[w - i - 1] * 2);
                } else if (ar[i] == 'x') {
                    findIt(i - 1, cur + pow[w - i - 1] * 1);
                } else if (ar[i] == 'o') {
                    findIt(i - 1, cur + pow[w - i - 1] * 1);
                    findIt(i - 1, cur + pow[w - i - 1] * 2);
                }
            }

        }

        public void solve(int testNumber, ScanReader in, PrintWriter out) {
            w = in.scanInt();
            int n = in.scanInt();
            int m = in.scanInt();
            int[] cnt = new int[4097];
            pow = new int[13];
            pow[0] = 1;
            for (int i = 1; i <= 12; i++) pow[i] = pow[i - 1] * 3;
            int[] ter = new int[4097];
            for (int i = 1; i < 4097; i++)
                for (int j = 0; j <= 12; j++)
                    if (((1 << j) & i) != 0) ter[i] += pow[j];
            int[] tt = new int[ter[1 << w] + 1];
            int ll = ter[4096];
            for (int i = 0; i < n; i++) tt[ter[in.scanInt()]]++;
            cnt1 = CodeHash.convolute(tt, tt);
            while (m-- > 0) {
                ans = 0;
                ar = in.scanString().toCharArray();
                findIt(ar.length - 1, 0);
                out.println(ans);
            }


        }

    }

    static class ScanReader {
        private byte[] buf = new byte[4 * 1024];
        private int index;
        private BufferedInputStream in;
        private int total;

        public ScanReader(InputStream inputStream) {
            in = new BufferedInputStream(inputStream);
        }

        private int scan() {
            if (index >= total) {
                index = 0;
                try {
                    total = in.read(buf);
                } catch (Exception e) {
                    e.printStackTrace();
                }
                if (total <= 0) return -1;
            }
            return buf[index++];
        }

        public int scanInt() {
            int integer = 0;
            int n = scan();
            while (isWhiteSpace(n)) n = scan();
            int neg = 1;
            if (n == '-') {
                neg = -1;
                n = scan();
            }
            while (!isWhiteSpace(n)) {
                if (n >= '0' && n <= '9') {
                    integer *= 10;
                    integer += n - '0';
                    n = scan();
                }
            }
            return neg * integer;
        }

        public String scanString() {
            int c = scan();
            if (c == -1) return null;
            while (isWhiteSpace(c)) c = scan();
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = scan();
            } while (!isWhiteSpace(c));
            return res.toString();
        }

        private boolean isWhiteSpace(int n) {
            if (n == ' ' || n == '\n' || n == '\r' || n == '\t' || n == -1) return true;
            else return false;
        }

    }

    static class CodeHash {
        public static long[] convolute(int[] a, int[] b) {
            int m = Integer.highestOneBit(Math.max(Math.max(a.length, b.length) - 1, 1)) << 2;
            double[][] fa = fft(a, m, false);
            double[][] fb = a == b ? fa : fft(b, m, false);
            for (int i = 0; i < m; i++) {
                double nfa0 = fa[0][i] * fb[0][i] - fa[1][i] * fb[1][i];
                double nfa1 = fa[0][i] * fb[1][i] + fa[1][i] * fb[0][i];
                fa[0][i] = nfa0;
                fa[1][i] = nfa1;
            }
            fft(fa[0], fa[1], true);
            long[] ret = new long[m];
            for (int i = 0; i < m; i++) {
                ret[i] = Math.round(fa[0][i]);
            }
            return ret;
        }

        public static double[][] fft(int[] srcRe, int n, boolean inverse) {
            int m = srcRe.length;
            double[] dstRe = new double[n];
            double[] dstIm = new double[n];
            for (int i = 0; i < m; i++) {
                dstRe[i] = srcRe[i];
            }

            int h = Integer.numberOfTrailingZeros(n);
            for (int i = 0; i < n; i++) {
                int rev = Integer.reverse(i) >>> 32 - h;
                if (i < rev) {
                    double d = dstRe[i];
                    dstRe[i] = dstRe[rev];
                    dstRe[rev] = d;
                }
            }

            for (int s = 2; s <= n; s <<= 1) {
                int nt = s >>> 1;
                double theta = inverse ? -2 * Math.PI / s : 2 * Math.PI / s;
                double wRe = Math.cos(theta);
                double wIm = Math.sin(theta);
                for (int j = 0; j < n; j += s) {
                    double wr = 1, wi = 0;
                    for (int t = j; t < j + nt; t++) {
                        int jp = t + nt;
                        double re = dstRe[jp] * wr - dstIm[jp] * wi;
                        double im = dstRe[jp] * wi + dstIm[jp] * wr;
                        dstRe[jp] = dstRe[t] - re;
                        dstIm[jp] = dstIm[t] - im;
                        dstRe[t] += re;
                        dstIm[t] += im;
                        double nwre = wr * wRe - wi * wIm;
                        double nwim = wr * wIm + wi * wRe;
                        wr = nwre;
                        wi = nwim;
                    }
                }
            }

            if (inverse) {
                for (int i = 0; i < n; i++) {
                    dstRe[i] /= n;
                    dstIm[i] /= n;
                }
            }

            return new double[][]{dstRe, dstIm};
        }

        public static void fft(double[] re, double[] im, boolean inverse) {
            int n = re.length;
            int h = Integer.numberOfTrailingZeros(n);
            for (int i = 0; i < n; i++) {
                int rev = Integer.reverse(i) >>> 32 - h;
                if (i < rev) {
                    double d = re[i];
                    re[i] = re[rev];
                    re[rev] = d;
                    d = im[i];
                    im[i] = im[rev];
                    im[rev] = d;
                }
            }

            for (int s = 2; s <= n; s <<= 1) {
                int nt = s >>> 1;
                double theta = inverse ? -2 * Math.PI / s : 2 * Math.PI / s;
                double wRe = Math.cos(theta);
                double wIm = Math.sin(theta);
                for (int j = 0; j < n; j += s) {
                    double wr = 1, wi = 0;
                    for (int t = j; t < j + nt; t++) {
                        int jp = t + nt;
                        double lre = re[jp] * wr - im[jp] * wi;
                        double lim = re[jp] * wi + im[jp] * wr;
                        re[jp] = re[t] - lre;
                        im[jp] = im[t] - lim;
                        re[t] += lre;
                        im[t] += lim;
                        double nwre = wr * wRe - wi * wIm;
                        double nwim = wr * wIm + wi * wRe;
                        wr = nwre;
                        wi = nwim;
                    }
                }
            }

            if (inverse) {
                for (int i = 0; i < n; i++) {
                    re[i] /= n;
                    im[i] /= n;
                }
            }
        }

    }
}