#include <bits/stdc++.h>
using namespace std;
#define int int64_t
constexpr int MOD = 1e9 + 7;
signed main() {
cin.tie(0)->sync_with_stdio(0);
int p, t;
cin >> p >> t;
vector<vector<int>> dp1(610, vector<int>(610, 0));
vector<vector<int>> dp2(610, vector<int>(610, 0));
dp1[0][0] = 1;
int cur = 0;
auto iterate = [&]() -> void {
for (int j = 0; j < 610; j++) {
for (int k = j; k < 610; k++) {
if (j + 2 < 610 && k + 1 < 610)
dp2[j][k] += dp1[j + 2][k + 1];
if (j == 0 && k + 1 < 610) {
dp2[j][k] += dp1[j + 1][k + 1];
dp2[j][k] += dp1[j][k + 1];
}
if (j - 1 >= 0 && k - 2 >= 0)
dp2[j][k] += dp1[j - 1][k - 2];
dp2[j][k] %= MOD;
}
}
swap(dp1, dp2);
for (int i = 0; i < 610; i++)
fill(dp2[i].begin(), dp2[i].end(), 0);
cur++;
};
vector<pair<int, int>> queries(t);
vector<int> ans(t, 0);
for (int i = 0; i < t; i++) {
cin >> queries[i].first;
queries[i].second = i;
}
sort(queries.begin(), queries.end());
for (int i = 0; i < t; i++) {
while (cur < queries[i].first)
iterate();
int anss = 0;
for (int i = 0; i < 610; i++)
anss += dp1[0][i];
anss %= MOD;
ans[queries[i].second] = anss;
}
copy(ans.begin(), ans.end(), ostream_iterator<int>(cout, "\n"));
}
