#define DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}
// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
public:
template<typename T>
_Debug& operator,(T val) {
cout << val << endl;
return *this;
}
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif
// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back
// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;
// ---------- END OF TEMPLATE ----------
int H = 7;
char S[(1 << 20)+1],T[21];
struct query { int m1,m2,i; };
query queries[1000000];
int pow3[21];
int ans[1000000];
int p[1594323],sum[1594323];
int main() {
int i,j;
int L,Q;
scanf("%d %d %s",&L,&Q,S);
H = min(H,L);
pow3[0] = 1;
for (i = 1; i <= L; i++) pow3[i] = pow3[i-1]*3;
for (i = 0; i < Q; i++) {
scanf("%s",T),queries[i].i = i;
reverse(T,T+H),reverse(T+H,T+L);
for (j = 0; j < H; j++) {
if (T[j] == '0') queries[i].m1 |= (1 << (2*j));
else if (T[j] == '1') queries[i].m1 |= (1 << (2*j+1));
else queries[i].m1 |= (1 << (2*j)) | (1 << (2*j+1));
}
for (j = H; j < L; j++) {
if (T[j] == '1') queries[i].m2 += pow3[j-H];
else if (T[j] == '?') queries[i].m2 += 2*pow3[j-H];
}
}
int k;
for (i = 0; i < pow3[L-H]; i++) {
int n = i;
p[i] = -1;
for (j = 0; j < L-H; j++) {
if ((n % 3) == 2) p[i] = j;
n /= 3;
}
}
for (i = 0; i < (1 << H); i++) {
for (j = 0; j < (1 << (L-H)); j++) {
int c = 0;
for (k = 0; k < L-H; k++) {
if (j & (1 << k)) c += pow3[k];
}
sum[c] = S[j+i*(1 << (L-H))]-'0';
}
for (j = 0; j < pow3[L-H]; j++) {
if (p[j] != -1) sum[j] = sum[j-pow3[p[j]]]+sum[j-2*pow3[p[j]]];
}
int m = 0;
for (j = 0; j < H; j++) {
if (i & (1 << j)) m |= (1 << (2*j+1));
else m |= (1 << (2*j));
}
for (j = 0; j < Q; j++) {
if ((queries[j].m1 & m) == m) ans[queries[j].i] += sum[queries[j].m2];
}
}
for (i = 0; i < Q; i++) printf("%d\n",ans[i]);
return 0;
}
