#pragma GCC optimize("O3,no-stack-protector,unroll-loops")
#pragma GCC target("avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define cerr cerr << "DEBUG "
constexpr int N = (1 << 20) + 10;
int a[N], f[N], g[N], h[N];
int n, m;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> m;
for (int i = 0; i < (1 << n); ++i) {
char c;
cin >> c;
a[i] = c - '0';
}
int comp = (1 << n) - 1;
for (int i = 0; i < (1 << n); ++i) {
f[i] = g[i ^ comp] = a[i];
}
for (int i = 0; i < n; ++i) {
for (int mask = 0; mask < (1 << n); ++mask) {
if ((mask >> i) & 1) {
f[mask] += f[mask ^ (1 << i)];
g[mask] += g[mask ^ (1 << i)];
}
}
}
for (int i = 0; i < (1 << n); ++i) {
h[i] = g[i ^ comp];
}
while (m--) {
string s;
cin >> s;
int cnt0 = 0, cnt1 = 0, num = 0, numm = 0;
reverse(s.begin(), s.end());
for (int i = 0; i < n; ++i) {
cnt0 += s[i] == '0';
cnt1 += s[i] == '1';
if (s[i] == '1') {
num += (1 << i);
numm += (1 << i);
}
if (s[i] == '?') {
numm += (1 << i);
}
}
int sum = 0;
if (cnt1 <= 6) {
for (int mask = 0; mask < (1 << cnt1); ++mask) {
int num2 = numm;
for (int c = 0, i = 0; i < n; ++i) {
if (s[i] == '1') {
num2 ^= ((mask >> c) & 1) << i;
++c;
}
}
sum += (__builtin_parity(mask) ? -1 : +1) * f[num2];
}
} else if (n - cnt0 - cnt1 <= 6) {
int cnt = n - cnt0 - cnt1;
for (int mask = 0; mask < (1 << cnt); ++mask) {
int num2 = num;
for (int c = 0, i = 0; i < n; ++i) {
if (s[i] == '?') {
num2 ^= ((mask >> c) & 1) << i;
++c;
}
}
sum += a[num2];
}
} else {
for (int mask = 0; mask < (1 << cnt0); ++mask) {
int num2 = num;
for (int c = 0, i = 0; i < n; ++i) {
if (s[i] == '0') {
num2 ^= ((mask >> c) & 1) << i;
++c;
}
}
sum += (__builtin_parity(mask) ? -1 : +1) * h[num2];
}
}
cout << sum << '\n';
}
}
