#pragma GCC optimize("Ofast,O3,unroll-loops")
#pragma GCC target("bmi,abm,fma,avx,avx2,popcnt,lzcnt")
#include <iostream>
#include <cassert>
#include <algorithm>
#include <string>
#include <bitset>
#include <vector>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <set>
#ifndef LOCAL
#include <bits/stdc++.h>
#define cerr if(false)cerr
#endif
using namespace std;
using ll = long long;
const int N = 2e6 + 66;
int up[N];
int dw[N];
vector<int>pos;
string vals, qs;
int L;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int q;
cin >> L >> q;
cin >> vals;
for (int i = 0 ; i < (1 << L) ; ++ i) {
up[i] = dw[i] = vals[i] - '0';
}
for (int i = 0 ; i < L ; ++ i) {
for (int m = 0 ; m < (1 << L) ; ++ m) {
if (!(m >> i & 1)) {
dw[m | (1 << i)] += dw[m];
}
}
}
for (int i = 0 ; i < L ; ++ i) {
for (int m = (1 << L) - 1 ; m >= 0 ; -- m) {
if (m >> i & 1) {
up[m ^ (1 << i)] += up[m];
}
}
}
while (q--) {
int ans = 0;
cin >> qs;
reverse(qs.begin(), qs.end());
int a = count(qs.begin(), qs.end(), '0');
int c = count(qs.begin(), qs.end(), '?');
if (c <= 6) {
pos.clear();
for (int i = 0 ; i < L ; ++ i) {
if (qs[i] == '?') {
pos.emplace_back(i);
}
}
int n = pos.size();
int base = 0;
for (int i = 0 ; i < L ; ++ i) {
if (qs[i] == '1') {
base |= 1 << i;
}
}
for (int m = 0 ; m < (1 << n) ; ++ m) {
int mask = base;
for (int i = 0 ; i < n ; ++ i) {
if (m >> i & 1) mask |= 1 << pos[i];
}
ans += vals[mask] - '0';
}
} else if (a <= 6) {
pos.clear();
for (int i = 0 ; i < L ; ++ i) {
if (qs[i] == '0') {
pos.emplace_back(i);
}
}
int n = pos.size();
int base = 0;
for (int i = 0 ; i < L ; ++ i) {
if (qs[i] == '1') {
base |= 1 << i;
}
}
for (int m = 0 ; m < (1 << n) ; ++ m) {
int mask = base;
for (int i = 0 ; i < n ; ++ i) {
if (m >> i & 1) mask |= 1 << pos[i];
}
int par = __builtin_popcount(m) & 1;
int cur = up[mask] * (par ? -1 : 1);
ans += cur;
}
} else {
pos.clear();
for (int i = 0 ; i < L ; ++ i) {
if (qs[i] == '1') {
pos.emplace_back(i);
}
}
int n = pos.size();
int base = 0;
for (int i = 0 ; i < L ; ++ i) {
if (qs[i] == '?') {
base |= 1 << i;
}
}
for (int m = 0 ; m < (1 << n) ; ++ m) {
int mask = 0;
for (int i = 0 ; i < n ; ++ i) {
if (m >> i & 1) mask |= 1 << pos[i];
}
int par = __builtin_popcount(((1 << n) - 1) ^ m) & 1;
int cur = dw[mask] * (par ? -1 : 1);
ans += cur;
}
}
cout << ans << "\n";
}
}
