/*
Author: Nguyen Chi Thanh - High School for the Gifted - VNU.HCM (i2528)
*/
#include <bits/stdc++.h>
using namespace std;
/* START OF TEMPALTE */
// #define int long long
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define popcount __builtin_popcountll
#define all(x) (x).begin(), (x).end()
#define BIT(x, i) (((x) >> (i)) & 1)
#define MASK(x) (1ll << (x))
#define SZ(a) ((int32_t)a.size())
#define debug(a, l, r) {for (int _i = (l); _i <= (r); ++_i) cout << (a)[_i] << ' '; cout << '\n';}
template<class X, class Y>
bool minimize(X &x, const Y &y) {
if (x > y) {
x = y;
return true;
} else return false;
}
template<class X, class Y>
bool maximize(X &x, const Y &y) {
if (x < y) {
x = y;
return true;
} else return false;
}
/* END OF TEMPALTE */
const int MAXN = 20;
int n, q, val[MASK(MAXN) + 5];
int dpSubset[MASK(MAXN) + 5], dpSuperset[MASK(MAXN) + 5];
void init() {
cin >> n >> q;
string s; cin >> s;
for (int i = 0; i < MASK(n); ++i) {
val[i] = (s[i] - '0');
dpSubset[i] = dpSuperset[i] = val[i];
}
for (int k = 0; k < n; ++k)
for (int mask = 0; mask < MASK(n); ++mask) {
if (BIT(mask, k)) dpSubset[mask] += dpSubset[mask ^ MASK(k)];
else dpSuperset[mask] += dpSuperset[mask ^ MASK(k)];
}
}
void solve() {
vector<int> pos;
int fullMask = MASK(n) - 1;
while (q--) {
string s; cin >> s;
reverse(all(s));
int cnt1 = 0, cnt0 = 0, cntQues = 0;
int mask1 = 0, mask0 = 0;
for (int i = 0; i < n; ++i) {
if (s[i] == '1') {
cnt1++;
mask1 |= MASK(i);
}
else if (s[i] == '0') {
cnt0++;
mask0 |= MASK(i);
}
else cntQues++;
}
int mi = min({cnt0, cnt1, cntQues});
if (mi == cnt0) {
pos.clear();
for (int i = 0; i < n; ++i)
if (s[i] == '0') pos.push_back(i);
int res = 0;
for (int mask = 0; mask < MASK(cnt0); ++mask) {
int nmask = mask1;
for (int i = 0; i < cnt0; ++i)
if (BIT(mask, i)) nmask |= MASK(pos[i]);
if (popcount(mask) & 1) res -= dpSuperset[nmask];
else res += dpSuperset[nmask];
}
cout << res << '\n';
continue;
}
if (mi == cnt1) {
pos.clear();
for (int i = 0; i < n; ++i)
if (s[i] == '1') pos.push_back(i);
int res = 0;
for (int mask = 0; mask < MASK(cnt1); ++mask) {
int nmask = mask0;
for (int i = 0; i < cnt1; ++i)
if (BIT(mask, i)) nmask |= MASK(pos[i]);
if (popcount(mask) & 1) res -= dpSubset[nmask ^ fullMask];
else res += dpSubset[nmask ^ fullMask];
}
cout << res << '\n';
continue;
}
int res = 0;
pos.clear();
for (int i = 0; i < n; ++i)
if (s[i] == '?') pos.push_back(i);
for (int mask = 0; mask < MASK(cntQues); ++mask) {
int nmask = mask1;
for (int i = 0; i < cntQues; ++i)
if (BIT(mask, i)) nmask |= MASK(pos[i]);
res += val[nmask];
}
cout << res << '\n';
}
}
signed main() {
#ifdef NCTHANH
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(nullptr); cout.tie(nullptr);
init();
solve();
return 0;
}
