#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 20;
;
char ch[] = {'A', 'O', 'X', 'a', 'o', 'x'};
map<char, int> mp;
int t[maxn], w;
int F[100][maxn / 10];
bool NoAns[100][maxn / 10];
int cnt[maxn], res[maxn], pw3[maxn], pw6[maxn];
string s[maxn];
void prepare() {
  pw3[0] = pw6[0] = 1;
  for (int i = 1; i < 30; i++) pw3[i] = pw3[i - 1] * 3, pw6[i] = pw6[i - 1] * 6;
  for (int i = 0; i < 6; i++) mp[ch[i]] = i;
}
void prepareF() {
  int hf = w / 2;
  for (int mask = 0; mask < (1 << hf); mask++)
    for (int f = 0; f < pw6[hf]; f++)
      for (int i = hf - 1; i >= 0; i--) {
        char tmp = ch[((f / pw6[i]) % 6)];
        int Ans = 0;
        if (tmp == 'A') {
          if (((mask >> i) & 1))
            Ans = 0;
          else
            Ans = 2;
        }
        if (tmp == 'a') {
          if (((mask >> i) & 1))
            Ans = 1;
          else
            NoAns[mask][f] = 1;
        }
        if (tmp == 'X') Ans = ((mask >> i) & 1);
        if (tmp == 'x') Ans = 1 ^ ((mask >> i) & 1);
        if (tmp == 'O') {
          if (((mask >> i) & 1))
            NoAns[mask][f] = 1;
          else
            Ans = 0;
        }
        if (tmp == 'o') {
          if (((mask >> i) & 1))
            Ans = 2;
          else
            Ans = 1;
        }
        F[mask][f] *= 3;
        F[mask][f] += Ans;
      }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  prepare();
  int n, m;
  cin >> w >> n >> m;
  if (w % 2) w++;
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    t[x]++;
  }
  for (int i = 0; i < m; i++) {
    cin >> s[i];
    if ((int)s[i].size() != w) s[i] = 'A' + s[i];
  }
  int hf = w / 2;
  prepareF();
  for (int mask = 0; mask < pw3[w]; mask++) {
    bool Found = 0;
    for (int i = 0; i < w; i++)
      if (((mask / pw3[i]) % 3) == 2) {
        Found = 1;
        cnt[mask] = cnt[mask - pw3[i]] + cnt[mask - pw3[i] * 2];
        break;
      }
    if (!Found) {
      int tmp = 0;
      for (int i = w - 1; i >= 0; i--) tmp = tmp * 2 + ((mask / pw3[i]) % 3);
      cnt[mask] = t[tmp];
    }
  }
  for (int i = 0; i < m; i++) {
    int A = 0, B = 0;
    for (int j = 0; j < hf; j++) A = A * 6 + mp[s[i][j]];
    for (int j = hf; j < w; j++) B = B * 6 + mp[s[i][j]];
    for (int j = 0; j < (1 << w); j++) {
      int x = j >> hf, y = (j ^ (x << hf));
      if (!NoAns[x][A] && !NoAns[y][B]) {
        int Shit = F[x][A] * pw3[hf] + F[y][B];
        res[i] += t[j] * cnt[Shit];
      }
    }
    cout << res[i] << endl;
  }
}
