/*
In the name of Allah
made by: Ahmed_Solyman
*/
#include <bits/stdc++.h>
#include <ext/rope>
using namespace std;
using namespace __gnu_cxx;
#pragma GCC optimize("-Ofast")
#pragma GCC optimize("-O1")
//-------------------------------------------------------------//
typedef long long ll;
typedef unsigned long long ull;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define PI acos(-1)
#define lb lower_bound
#define ub upper_bound
#define endl '\n'
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define sum_to(n) (n*(n+1))/2
#define pb push_back
#define pf push_front
#define fil(arr,x) memset(arr,x,sizeof(arr))
#define REP(i,a,b) for (int i=a;i<=b;i++)
#define F first
#define S second
#define MP make_pair
const ll mod=1e9+7;
int dx[8]={0,1,0,-1,1,1,-1,-1};
int dy[8]={1,0,-1,0,1,-1,-1,1};
//-------------------------------------------------------------//
ll lcm(ll a,ll b)
{
return (max(a,b)/__gcd(a,b))*min(a,b);
}
void person_bool(bool x)
{
cout<<(x?"YES":"NO")<<endl;
}
const int N=20;
int cost[1<<N];
int rev[1<<N];
int dp[1<<N];
int dp_rev[1<<N];
int main()
{
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
fast
int n,q;
cin>>n>>q;
string s;
cin>>s;
for (int i=0;i<(1<<n);i++) {
cost[i]=s[i]-'0';
rev[(1<<n)-1-i]=cost[i];
dp[i]=cost[i];
dp_rev[(1<<n)-1-i]=cost[i];
}
for (int i=0;i<n;i++)
for (int j=0;j<(1<<n);j++)
if ((1<<i)&j)
dp[j]+=dp[j^(1<<i)],dp_rev[j]+=dp_rev[j^(1<<i)];
vector<int>vec(1<<5);
vector<int>ans=vec;
while (q--) {
string s;
cin>>s;
reverse(all(s));
int zero=0,one=0,g=0;
int idx=0;
for (auto i:s) {
if (i=='0')zero|=(1<<idx);
if (i=='1')one|=(1<<idx);
if (i=='?')g|=(1<<idx);
++idx;
}
if (__builtin_popcount(g)<=8) {
int ans=0;
for (int mask=g;mask>=0;mask=(mask-1)&g) {
ans+=cost[mask | one];
if (mask==0)break;
}
cout<<ans<<endl;
}
else if (__builtin_popcount(one)<=5){
for (int mask=0;mask<(1<<__builtin_popcount(one));mask++)
vec[mask]=ans[mask]=0;
int cnt=1<<__builtin_popcount(one);
for (int mask=one;mask>=0;mask=(mask-1)&one) {
vec[--cnt]=mask;
if (mask==0)break;
}
ans[0]=dp[g];
for (int mask=1;mask<(1<<__builtin_popcount(one));mask++) {
ans[mask] = dp[vec[mask] | g];
for (int j=(mask-1)&mask;j>=0;j=(j-1)&mask) {
ans[mask]-=ans[j];
if (j==0)break;
}
}
cout<<ans[(1<<__builtin_popcount(one))-1]<<endl;
}
else {
for (int mask=0;mask<(1<<__builtin_popcount(zero));mask++)
vec[mask]=ans[mask]=0;
int cnt=1<<__builtin_popcount(zero);
for (int mask=zero;mask>=0;mask=(mask-1)&zero) {
vec[--cnt]=mask;
if (mask==0)break;
}
for (int mask=(1<<__builtin_popcount(zero))-1;mask>=0;mask--) {
ans[mask] += dp_rev[(zero ^ vec[mask]) | g];
if (mask==0)break;
for (int j=(mask-1)&mask;j>=0;j=(j-1)&mask) {
ans[j]-=ans[mask];
if (j==0)break;
}
}
cout<<ans[0]<<endl;
}
}
return 0;
}
