#include <bits/stdc++.h>
using namespace std;
#define el '\n';
#define ll long long
#define fi first
#define se second
#define BIT(mask, i) (((mask) >> (i)) & 1)
#define MASK(i) (1LL << (i))
template <class T1, class T2>
bool minimize(T1 &a, T2 b) {
if(a > b) {a = b; return true;} return false;
}
template <class T1, class T2>
bool maximize(T1 &a, T2 b) {
if(a < b) {a = b; return true;} return false;
}
const int MOD = (int)1e9 + 7;
template <class T1, class T2>
void add (T1 &a, T2 b) {
a += b;
if (a >= MOD) a -= MOD;
}
const int N = 50100;
const int oo = (int)1e9 + 7;
const ll INF = (ll)1e18 + 9LL;
const int LOG = 22;
int nSeg, nQuery;
string toxicity;
void init (void) {
cin >> nSeg >> nQuery >> toxicity;
}
namespace subtask1 {
bool ok (void) {
return nSeg <= 10 && nQuery <= 1000;
}
long long res = 0;
void Try (string s, int i, int mask) {
if(i >= s.size()) {
res += (toxicity[mask] - '0');
return;
}
long long res = 0;
if(s[i] != '?') {
Try (s, i + 1, mask + (s[i] - '0') * MASK(i));
}
else {
Try (s, i + 1, mask + MASK(i));
Try (s, i + 1, mask);
}
}
void solve (void) {
for (int i = 1; i <= nQuery; i++) {
string s; cin >> s;
reverse(s.begin(), s.end());
Try (s, 0, 0);
cout << res << el;
res = 0;
}
}
}
namespace subtask2 {
bool ok (void) {
return nSeg <= 13;
}
vector <string> pattern;
void gen_pattern (int i, string s) {
if(i >= nSeg) {
pattern.push_back(s);
return;
}
gen_pattern (i + 1, s + '0');
gen_pattern (i + 1, s + '1');
gen_pattern (i + 1, s + '?');
}
long long res = 0;
void Try (string s, int i, int mask) {
if(i >= s.size()) {
res += (toxicity[mask] - '0');
return;
}
if(s[i] != '?') {
Try (s, i + 1, mask + (s[i] - '0') * MASK(i));
}
else {
Try (s, i + 1, mask + MASK(i));
Try (s, i + 1, mask);
}
}
map <string, long long> ans;
void solve (void) {
gen_pattern(0, "");
for (int i = 0; i < pattern.size(); i++) {
Try (pattern[i], 0, 0);
ans[pattern[i]] = res;
// cout << pattern[i] << ' << el;
res = 0;
}
for (int i = 1; i <= nQuery; i++) {
string s; cin >> s;
reverse(s.begin(), s.end());
cout << ans[s] << el;
}
}
}
void solve (void) {
if(subtask1::ok()) {subtask1::solve(); return;}
if(subtask2::ok()) {subtask2::solve(); return;}
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int ntest = 1;
while(ntest--) {
init();
solve();
}
return 0;
}
