#include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#define dbg(...) printf(__VA_ARGS__);
#define getchar_unlocked getchar
#else
#define dbg(...)
#endif
#define sf scanf
#define pf printf
#define fi first
#define se second
#define pb push_back
#define psf push_front
#define ppb pop_back
#define ppf pop_front
#define sz(x) (int)x.size()
#define mnto(x,y) x=min(x,(__typeof__(x))y)
#define mxto(x,y) x=max(x,(__typeof__(x))y)
#define INF 1023456789
#define LINF 1023456789123456789
#define all(x) x.begin(),x.end()
#define lb(x,v) (lower_bound(all(x),v)-x.begin())
#define ub(x,v) (upper_bound(all(x),v)-x.begin())
#define disc(x) sort(all(x));x.resize(unique(all(x))-x.begin());
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef pair<ll,ll> pll;
typedef tuple<int,int,int> iii;
typedef tuple<int,int,int,int> iiii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
mt19937 rng(time(0));
#define mod 1000000007
inline int add(int a,int b){
int r=a+b;
while(r>=mod)r-=mod;
while(r<0)r+=mod;
return r;
}
inline int mult(int a,int b){
return (int)(((ll)(a*b))%mod);
}
inline int rd(){
int x=0;
char ch=getchar_unlocked();
while(!(ch&16))ch=getchar();//keep reading while current character is whitespace
while(ch&16){//this will break when ‘\n’ or ‘ ‘ is encountered
x=(x<<3)+(x<<1)+(ch&15);
ch=getchar_unlocked();
}
return x;
}
#define maxn ((1<<20)+5)
int l,q,t[maxn],super[maxn],sub[maxn];
char s[maxn];
int main(){
sf("%d%d",&l,&q);
sf(" %s",&s);
for(int i=0;i<(1<<l);++i){
t[i]=s[i]-'0';
sub[i]=super[i]=t[i];
}
for(int i=0;i<l;++i){
for(int j=0;j<(1<<l);++j){
if(j&(1<<i))sub[j]+=sub[j^(1<<i)];
}
}
for(int i=0;i<l;++i){
for(int j=(1<<l)-1;j>=0;--j){
if((j&(1<<i))==0)super[j]+=super[j^(1<<i)];
}
}
while(q--){
sf(" %s",&s);
int a=0,b=0,c=0;
vi apos,bpos,cpos;
for(int i=0;i<l;++i){
if(s[i]=='0')++a,apos.pb(l-i-1);
else if(s[i]=='1')++b,bpos.pb(l-i-1);
else ++c,cpos.pb(l-i-1);
}
if(c<=6){
int ans=0,m=0;
for(int i:bpos)m^=1<<i;
for(int i=0;i<(1<<c);++i){
int nm=m,ti=i;
for(int j=0;j<c;++j){
nm^=(ti&1)<<cpos[j];
ti>>=1;
}
ans+=t[nm];
}
pf("%d\n",ans);
}
else if(a<=6){
int ans=0;
int m=0;
for(int i:bpos)m^=1<<i;
for(int i=0;i<(1<<a);++i){
int nm=m,t=i,tot=0;
for(int j=0;j<a;++j){
nm^=(t&1)<<apos[j];
tot+=t&1;
t>>=1;
}
ans+=super[nm]*(tot%2?-1:1);
}
pf("%d\n",ans);
}
else{
int ans=0;
int m=0;
for(int i:cpos)m^=1<<i;
for(int i=0;i<(1<<b);++i){
int nm=m,t=i,tot=0;
for(int j=0;j<b;++j){
nm^=(t&1)<<bpos[j];
tot+=t&1;
t>>=1;
}
ans+=sub[nm]*((b-tot)%2?-1:1);
}
pf("%d\n",ans);
}
}
}
