#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=1e6+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,po[20];
string s;
int dp[(3<<10)];
bool M2;
void solve(){
cin >> node >> query >> s;
int n=(1<<node);
po[0]=1;
for(int i=1;i<=node;++i)po[i]=po[i-1]*3;
for(int i=0;i<n;++i){
vector<int>x;
int val=i;
while(val>0){
x.emb(val%2);
val>>=1;
}
while(sz(x)!=node)x.emb(0);
// cout <<i<<'\n';
int vt=0;
for(int i=0;i<sz(x);++i){
vt+=po[i]*x[i];
// cout <<x[i];
}
dp[vt]=s[i]-'0';
// cout <<i<<" "<<vt<<" "<<s[i]<<'\n';
// cout <<'\n'<<vt<<'\n';
// cout <<i<<" "<<vt<<" "<<dp[vt]<<'\n';
}
for(int i=0;i<pow(3,node);++i){
for(int j=0;j<node;++j){
int x=po[j];
int digit=(i/x)%3;
if(digit!=2)continue;
dp[i]=dp[i-x]+dp[i-2*x];
// if(vt==24){
// for(auto y:x)cout <<y;cout<<'\n';
// cout <<i<<" "<<dp[i]<< " "<<dp[vt]<<'\n';
// }
}
}
// cout <<dp[]
while(query--){
string x;
cin >> x;
int val=0;
reverse(all(x));
for(int i=0;i<node;++i){
val+=(x[i]=='0'?0:x[i]=='1'?pow(3,i):2*pow(3,i));
}
cout <<dp[val]<<'\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;
}
