#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=a;i<=(int)b;i++)
#define FORD(i,a,b) for(int i=a;i>=(int)b;i--)
#define ll long long
#define fi first
#define se second
#define pb push_back
#define all(a) a.begin(),a.end()
#define BIT(mask,i) ((mask>>(i))&1)
#define MASK(a) (1LL<<((a)))
#define uni(v) sort(all(v)); v.resize(unique(all(v)) - v.begin())
#define pii pair <int, int>
#define vi vector <int>
#define vl vector <ll>
template <class A,class B>
bool maximize(A &a, const B b)
{
if(a < b){ a = b; return 1;} return 0;
}
template <class A,class B>
bool minimize(A &a, const B b)
{
if(a > b){ a = b; return 1;} return 0;
}
const int maxn = 3e6 + 5;
int n, q;
string s, a;
ll dpsub[maxn], dppar[maxn];
void solve()
{
cin >> n >> q >> s;
a = s;
FOR(i, 0, MASK(n) - 1) dpsub[i] = dppar[i] = s[i] - '0';
for(int i = 0; i < n; i++) for(int mask = 0; mask < (1 << n); mask++)
{
if(BIT(mask, i)) dpsub[mask]+= dpsub[mask ^ (1 << i)];
else dppar[mask]+= dppar[mask ^ (1 << i)];
}
while(q--)
{
string s; cin >> s;
int mask = 0;
reverse(all(s));
ll ans = 0;
vector <int> vec, vec0, vec1;
FOR(i, 0, n - 1)
{
if(s[i] == '0') vec0.push_back(i);
else if(s[i] == '1') vec1.push_back(i);
else vec.push_back(i);
}
if(vec1.size() <= 6)
{
int mask = 0;
FOR(i, 0, n - 1) if(s[i] == '1' || s[i] == '?') mask |= (1 << i);
FOR(sm, 0, MASK(vec1.size()) - 1)
{
int cnt = __builtin_popcount(sm);
int smm = mask;
FOR(i, 0, vec1.size() - 1) if(BIT(sm, i)) smm ^= (1 << vec1[i]);
if(cnt & 1) ans-= dpsub[smm];
else ans+= dpsub[smm];
}
cout << ans << "\n";
}
else if(vec0.size() <= 6)
{
int mask = 0;
FOR(i, 0, n - 1) if(s[i] == '1') mask |= (1 << i);
FOR(sm, 0, MASK(vec0.size()) - 1)
{
int cnt = __builtin_popcount(sm);
int smm = mask;
FOR(i, 0, vec0.size() - 1) if(BIT(sm, i)) smm ^= (1 << vec0[i]);
if(cnt & 1) ans-= dppar[smm];
else ans+= dppar[smm];
}
cout << ans << "\n";
} else
{
int mask = 0;
FOR(i, 0, n - 1) if(s[i] == '1') mask |= (1 << i);
FOR(sm, 0, MASK(vec.size()) - 1)
{
int smm = mask;
FOR(i, 0, vec.size() - 1) if(BIT(sm, i)) smm |= (1 << vec[i]);
ans+= (a[smm] - '0');
}
cout << ans << "\n";
}
}
}
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
#define kieuoanh "kieuoanh"
if(fopen(kieuoanh".inp","r"))
{
freopen(kieuoanh".inp","r",stdin);
freopen(kieuoanh".out","w",stdout);
}
int tst = 1;
// cin >> tst;
while(tst--) solve();
return 0;
}
