#include <bits/stdc++.h>
using namespace std;
int N, L, Q;
int arr[1<<20];
int pre[2][1<<20];
int cnt[3];
vector<int> lst;
void rec(int n, vector<int> v){
if(n == -1){
int msk = 0;
for(int m = 0; m<L; m++){
msk *= 2;
msk += v[m];
}
lst.emplace_back(msk);
return;
}
//long long ret = 0;
if(v[n] == 2){
v[n] = 0;
rec(n-1, v);
v[n] = 1;
rec(n-1, v);
v[n] = 2;
}
else{
rec(n-1, v);
}
}
int main(){
cin.sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> L >> Q;
N = 1<<L;
for(int m = 0; m<N; m++){
char c;
cin >> c;
arr[m] = c-'0';
pre[0][m] = arr[m];
}
for(int m = 0; m<N; m++){
pre[1][m] = arr[m^(N-1)];
}
for(int d = 0; d<L; d++){
for(int m = N-1; m>=0; m--){
if((1<<d)&m){
pre[0][m] += pre[0][m^(1<<d)];
pre[1][m] += pre[1][m^(1<<d)];
}
}
}
/*
for(int m = 0; m<N; m++){
//cout << m << " " << pre[0][m] << "\n";
}
*/
while(Q--){
vector<int> v;
cnt[0] = cnt[1] = cnt[2] = 0;
for(int k = 0; k<L; k++){
char c;
cin >> c;
if(c == '?'){
v.emplace_back(2);
}
else{
v.emplace_back(c-'0');
}
cnt[v.back()]++;
}
long long ret = 0;
if(min({cnt[0], cnt[1], cnt[2]}) == cnt[2]){
rec(L-1, v);
for(int m : lst){
ret += arr[m];
}
}
else if(min({cnt[0], cnt[1], cnt[2]}) == cnt[1]){
for(int k = 0; k<L; k++){
if(v[k] == 2){
v[k] = 1;
}
else if(v[k] == 1){
v[k] = 2;
}
else{
v[k] = 0;
}
}
rec(L-1, v);
for(int m : lst){
int c = __builtin_popcount(m)&1;
c *= 2;
c--;
ret += pre[0][m]*c;
}
}
else{
for(int k = 0; k<L; k++){
if(v[k] == 2){
v[k] = 1;
}
else if(v[k] == 1){
v[k] = 0;
}
else{
v[k] = 2;
}
}
rec(L-1, v);
for(int m : lst){
int c = __builtin_popcount(m)&1;
c *= 2;
c--;
ret += pre[1][m]*c;
}
}
cout << abs(ret) << "\n";
lst.clear();
}
}
/*
#include <bits/stdc++.h>
using namespace std;
int N, L, Q, T;
int arr[1<<20];
int dp[60000];
vector<char> ternary[60000];
int pows[20];
int pre[1000005];
vector<char> qu[1000005];
int ans[1000005];
int main(){
cin.sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> L >> Q;
N = 1<<L;
for(int m = 0; m<N; m++){
char c;
cin >> c;
arr[m] = c-'0';
}
int H = L/2;
T = 1;
pows[0] = 1;
for(int k = 0; k<H; k++){
T *= 3;
pows[k+1] = pows[k] * 3;
}
for(int m = 0; m<T; m++){
int temp = m;
for(int k = 0; k<H; k++){
ternary[m].emplace_back(temp%3);
temp /= 3;
}
}
for(int q = 1; q<=Q; q++){
int t = 0;
for(int i = 0; i<L; i++){
char c;
cin >> c;
if(c == '?'){
qu[q].emplace_back(2);
}
else{
qu[q].emplace_back(c-'0');
}
}
for(int k = 0; k<H; k++){
t *= 3;
t += qu[q][k];
}
reverse(qu[q].begin(), qu[q].end());
pre[q] = t;
}
for(int m = 0; m<1<<(L-H); m++){
fill(dp, dp+T, 0);
for(int t = 0; t<T; t++){
bool has2 = 0;
int temp = 0;
for(int h = 0; h<H; h++){
if(ternary[t][h] == 2){
has2 = 1;
dp[t] = dp[t-pows[h]] + dp[t-pows[h]*2];
break;
}
temp += (1<<h)*ternary[t][h];
}
if(!has2){
dp[t] = arr[(temp<<(L-H)) + m];
}
}
for(int q = 1; q<=Q; q++){
bool good = 1;
for(int b = 0; b<L-H; b++){
if(qu[q][b] == 2 || qu[q][b] == ((m>>b)&1)){
}
else{
good = 0;
break;
}
}
if(good){
ans[q] += dp[pre[q]];
}
}
}
for(int q = 1; q<=Q; q++){
cout << ans[q] << "\n";
}
}
*/
