#include<bits/stdc++.h>
using namespace std;
bool M1;
#define PI 3.14159265358979323846
#define sz(a) (int)a.size()
#define all(x) x.begin(),x.end()
#define ii pair<int,int>
#define iii pair<int,ii>
#define iv pair<ii,ii>
#define se second
#define fi first
#define ffi fi.fi
#define sfi se.fi
#define sse se.se
#define fse fi.se
#define lt(i, c, d) for(int i = c; i <= d; ++i)
#define fl(i, c, d) for(int i = d; i >= c; --i)
#define pb push_back
#define emb emplace_back
#define emf emplace_front
#define em emplace
#define look_memory cerr<<abs(&M2-&M1)/1024.0/1024<<'\n'
#define look_time cerr << "TIME : " << clock() * 0.001 << "s" <<'\n'
const int N=5e6+5,lg=30,mod=1e9+7;
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int Rand(int u,int v){
return u+rd()%(v-u+1);
}
int dx[]={1,0,-1,0,1,1,-1,-1};
int dy[]={0,-1,0,1,1,-1,1,-1};
int node,query,ans;
string s,x;
int dpcha[N],dpcon[N],po[N];
void backtrack1(int i,vector<int>&res,bool c){
if(i==sz(res)){
int val=0;
for(int j=0;j<node;++j){
if(x[j]=='?'){
val|=(1<<j);
continue;
}
val|=((x[j]-'0')<<j);
}
// cout <<x<<'\n';
// cout <<val<<'\n';
// cout <<val<<" "<<c<<" "<<dpcon[val]<<'\n';
ans+=(c&1?-1:1)*dpcha[val];
return;
}
x[res[i]]='0';
backtrack1(i+1,res,c^1);
x[res[i]]='1';
backtrack1(i+1,res,c);
}
void backtrack0(int i,vector<int>&res,bool c){
if(i==sz(res)){
int val=0;
for(int j=0;j<node;++j){
if(x[j]=='?')continue;
val|=((x[j]-'0')<<j);
}
// cout <<x<<'\n';
// cout <<val<<'\n';
// cout <<val<<" "<<c<<" "<<dpcon[val]<<'\n';
ans+=(c&1?-1:1)*dpcon[val];
return;
}
x[res[i]]='0';
backtrack0(i+1,res,c);
x[res[i]]='1';
backtrack0(i+1,res,c^1);
}
void backtrack(int i,vector<int>&res){
if(i==sz(res)){
int val=0;
for(int j=0;j<node;++j){
val|=((x[j]-'0')<<j);
}
// cout <<x<<'\n';
// cout <<val<<'\n';
ans+=s[val]-'0';
return;
}
x[res[i]]='0';
backtrack(i+1,res);
x[res[i]]='1';
backtrack(i+1,res);
}
bool M2;
void solve(){
cin >> node >> query >> s;
for(int i=0;i<(1<<node);++i){
dpcon[i]=s[i]-'0';
dpcha[i]=s[i]-'0';
}
for(int j=0;j<node;++j){
for(int mask=0;mask<(1<<node);++mask){
if(mask>>j&1)dpcha[mask]+=dpcha[mask^(1<<j)];
else dpcon[mask]+=dpcon[mask^(1<<j)];
}
}
// cout <<dp[]
while(query--){
cin >> x;
vector<int>vec[3];
ans=0;
reverse(all(x));
for(int i=0;i<sz(x);++i){
char y=x[i];
if(y=='?')vec[0].emb(i);
if(y=='0')vec[1].emb(i);
if(y=='1')vec[2].emb(i);
}
if(sz(vec[0])<=sz(x)/3){
backtrack(0,vec[0]);
}
else
if(sz(vec[1])<=sz(x)/3){
// backtrack1(0,vec[2],0);
backtrack0(0,vec[1],0);
}
else{
// backtrack0(0,vec[1],0);
backtrack1(1,vec[2],0);
}
cout <<ans<<'\n';
}
}
main()
{
srand(time(0));
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#define task "aws"
if(fopen(task".inp","r")){
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
int t=1;
// cin >> t;
while(t--){
solve();
}
look_memory;
look_time;
}
