#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define bl " "
#define endl "\n"
#define all(v) v.begin(), v.end()
#define comp(v) v.erase(unique(all(v)), v.end())
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<pi, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 1000100;
const int MOD = 1e9+7;
struct Query {
string s; int x;
}qry[MAXN];
vector<int> v;
int ans[MAXN], l;
void solve(int s, int e, vector<int>& v, int p, int x) {
if(s > e) return;
if(x == 0) {
for(int i = s; i <= e; i++) ans[qry[i].x] = v[p];
return;
}
int a = s;
for(a = s; a <= e; a++) {
if(qry[a].s[l-x] != '0') break;
}
solve(s, a-1, v, p, x-1);
s = a;
for(; a <= e; a++) {
if(qry[a].s[l-x] != '1') break;
}
solve(s, a-1, v, p+(1<<(x-1)), x-1);
s = a;
vector<int> w;
for(int i = p; i < p+(1<<(x-1)); i++) w.push_back(v[i]+v[i+(1<<(x-1))]);
solve(s, e, w, 0, x-1);
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int q; cin >> l >> q;
string s; cin >> s;
for(int i = 0; i < s.size(); i++) v.push_back(s[i]-'0');
for(int i = 0; i < q; i++) {
cin >> qry[i].s; qry[i].x = i;
}
sort(qry, qry+q, [](Query a, Query b){return a.s < b.s;});
solve(0, q-1, v, 0, l);
for(int i = 0; i < q; i++) cout << ans[i] << endl;
}
