// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #include <x86intrin.h>
#include <bits/stdc++.h>
#include <chrono>
#include <random>
// @author: Vlapos
namespace operators
{
template <typename T1, typename T2>
std::istream &operator>>(std::istream &in, std::pair<T1, T2> &x)
{
in >> x.first >> x.second;
return in;
}
template <typename T1, typename T2>
std::ostream &operator<<(std::ostream &out, std::pair<T1, T2> x)
{
out << x.first << " " << x.second;
return out;
}
template <typename T1>
std::istream &operator>>(std::istream &in, std::vector<T1> &x)
{
for (auto &i : x)
in >> i;
return in;
}
template <typename T1>
std::ostream &operator<<(std::ostream &out, std::vector<T1> &x)
{
for (auto &i : x)
out << i << " ";
return out;
}
template <typename T1>
std::ostream &operator<<(std::ostream &out, std::set<T1> &x)
{
for (auto &i : x)
out << i << " ";
return out;
}
}
// name spaces
using namespace std;
using namespace operators;
// end of name spaces
// defines
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define f first
#define s second
#define uint unsigned int
#define all(vc) vc.begin(), vc.end()
// end of defines
// usefull stuff
void boost()
{
ios_base ::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
inline int getbit(int &x, int &bt) { return (x >> bt) & 1; }
const int dx4[4] = {-1, 0, 0, 1};
const int dy4[4] = {0, -1, 1, 0};
const int dx8[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
const int dy8[8] = {-1, -0, 1, -1, 1, -1, 0, 1};
const ll INF = (1e18) + 500;
const int BIG = (1e9) * 2 + 100;
const int MAXN = (1e5) + 5;
const int MOD7 = (1e9) + 7;
const int MOD9 = (1e9) + 9;
const uint MODFFT = 998244353;
#define int ll
struct test
{
void solve(int testcase)
{
boost();
int n, q;
cin >> n >> q;
int mxBit = n;
n = 1 << n;
vector<int> cost(n);
vector<int> overMask(n), subMask(n);
for (int i = 0; i < n; ++i)
{
char x;
cin >> x;
cost[i] = x - '0';
overMask[i] = subMask[i] = cost[i];
}
for (int i = 0; i < mxBit; ++i)
{
for (int mask = n - 1; mask > 0; --mask)
if (((mask >> i) & 1))
subMask[mask] += subMask[mask ^ (1 << i)];
for (int mask = 0; mask < n; ++mask)
if (!((mask >> i) & 1))
overMask[mask] += overMask[mask ^ (1 << i)];
}
// for (int i = 0; i < n; ++i)
// cout << i << ": " << overMask[i] << "\n";
for (int i = 0; i < q; ++i)
{
int mask0 = 0, mask1 = 0, maskq = 0;
int c0 = 0, c1 = 0, cq = 0;
string T;
cin >> T;
reverse(all(T));
for (int p = 0; p < mxBit; ++p)
{
char x = T[p];
if (x == '0')
c0++, mask0 += (1 << p);
if (x == '1')
c1++, mask1 += (1 << p);
if (x == '?')
cq++, maskq += (1 << p);
}
int res = 0;
if (min({c0, c1, cq}) == cq)
{
for (int mask = maskq;; mask = (mask - 1) & maskq)
{
res += cost[mask1 | mask];
if (mask == 0)
break;
}
}
else if (min({c0, c1, cq}) == c0)
{
for (int mask = mask0;; mask = (mask - 1) & mask0)
{
res += ((__builtin_popcount(mask) % 2) ? -1 : 1) * overMask[mask | mask1];
if (mask == 0)
break;
}
}
else
{
int cur = mask1 | maskq;
for (int mask = mask1;; mask = (mask - 1) & mask1)
{
res += ((__builtin_popcount(mask) % 2) ? -1 : 1) * subMask[cur ^ mask];
if (mask == 0)
break;
}
}
cout << res << '\n';
}
}
};
main()
{
boost();
int q = 1;
// cin >> q;
for (int i = 0; i < q; i++)
{
test t;
t.solve(i);
}
return 0;
}
//[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]//
// //
// Coded by Der_Vlἀpos //
// //
//[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]//
