#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) begin(a),end(a)
const int B1 = 7;
const int N = 1<<B1;
const int B2 = 13;
const int N2 = 1<<B2;
const int M = 1594324;
vector<array<int,2>> v, w[N];
string s;
int l, q, ans[M], dp[M];
int nx[2][M];
bitset<N> submask[2187];
int calc(string lol){
int p = 1, ans = 0, xd;
for(int i = 0; i < sz(lol); i++){
if(lol[i]=='?') xd=2;
else xd = lol[i]-'0';
ans+=xd*p, p*=3;
}
return ans;
}
int calc(int lol){
int p = 1, ans = 0;
for(int i = 0; i < B1; i++)
ans+=(lol>>i&1)*p, p*=3;
return ans;
}
int32_t main(){
ios_base::sync_with_stdio(false); cin.tie(0);
cin >> l >> q >> s;
memset(nx,-1,sizeof(nx));
for(int i = 0; i < M; i++){
int xd = i, p = 1;
while(xd){
int r = xd%3;
if(r==2){
nx[0][i] = i-2*p;
nx[1][i] = i-p; break;
}
xd/=3; p*=3;
}
}
for(int i = 0; i < 2187; i++){
for(int j = 0; j < N; j++){
int ok = 1, cur = i, cur2 = j;
for(int k = 0; k < 7; k++){
int t = cur%3, t2=cur2%2; cur/=3; cur2/=2;
if(t==2) continue;
if(t==t2) continue;
ok=0; break;
}
if(ok) submask[i][j]=1;
}
}
for(int mask = 0; mask < (1<<l); mask++){
int m1 = 0, m2 = mask;
if(l>B1) m1 = mask&((1<<B1)-1), m2>>=B1;
w[m1].pb({calc(m2),s[mask]-'0'});
}
for(int i = 0; i < q; i++){
string t; cin >> t;
reverse(all(t)); string x="";
if(l>B1) x = t.substr(0,B1),t=t.substr(B1);
v.pb({calc(x),calc(t)});
}
for(int _ = 0; _ < N; _++){
if(!sz(v[_])) continue;
memset(dp,0,sizeof(dp));
for(auto [xd,sc] : w[_]) dp[xd]+=sc;
for(int i = 0; i < M; i++)
if(nx[0][i]!=-1) dp[i]+=dp[nx[0][i]]+dp[nx[1][i]];
for(int i = 0; i < q; i++){
auto [x,y] = v[i];
if(submask[x][_]) ans[i]+=dp[y];
}
}
for(int i = 0; i < q; i++) cout << ans[i] << "\n";
}
