#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

using ll = long long;

constexpr int MOD = 1000000007;

class mint {
  int n;
public:
  mint(int n_ = 0) : n(n_) {}
  explicit operator int() { return n; }
  friend mint operator-(mint a) { return -a.n + MOD * (a.n != 0); }
  friend mint operator+(mint a, mint b) { int x = a.n + b.n; return x - (x >= MOD) * MOD; }
  friend mint operator-(mint a, mint b) { int x = a.n - b.n; return x + (x < 0) * MOD; }
  friend mint operator*(mint a, mint b) { return (long long)a.n * b.n % MOD; }
  friend mint &operator+=(mint &a, mint b) { return a = a + b; }
  friend mint &operator-=(mint &a, mint b) { return a = a - b; }
  friend mint &operator*=(mint &a, mint b) { return a = a * b; }
  friend bool operator==(mint a, mint b) { return a.n == b.n; }
  friend bool operator!=(mint a, mint b) { return a.n != b.n; }
  friend istream &operator>>(istream &i, mint &a) { return i >> a.n; }
  friend ostream &operator<<(ostream &o, mint a) { return o << a.n; }
};

vector<mint> kakeru(vector<mint> a, vector<mint> b) {
    const int n = a.size();
    const int m = b.size();
    vector<mint> c(n + m - 1);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            c[i + j] += a[i] * b[j];
        }
    }
    return c;
}

vector<mint> nizyou(vector<mint> a) {
    return kakeru(a, a);
}

// b[0] が 1 でないと正しく動かない。
vector<mint> waru(vector<mint> a, vector<mint> b, int n) {
    a.resize(n + 1);
    const int m = b.size();
    vector<mint> c(n + 1);
    for (int i = 0; i <= n; i++) {
        c[i] = a[i];
        for (int j = 0; j < m && i + j <= n; j++) {
            a[i + j] -= b[j] * c[i];
        }
    }
    return c;
}


int main() {
    mint p;
    cin >> p;
    int Q;
    cin >> Q;
    // x^2f(x) =                     a[0] x^2 + a[1] x^3 + ...
    // px f(x) =         pa[0]x +    pa[1]x^2 + pa[2]x^3 + ...
    // f(x)    =  a[0] +  a[1]x +    a[2] x^2 + a[3]x^3  + ...
    // -------------------------------------------------------
    // f(x) - px f(x) - x^2 f(x) = a[0] + a[1]*x + a[2]*x^2 - p*a[0]*x - p*a[1]*x^2 - a[0]*x^2
    //                           = x^2
    // f(x) = x^2 / (1 - px - x^2)
    // f(x)^2 = x^4 / (1 - px - x^2)^2

    vector<mint> bunsi = {0, 0, 0, 0, 1};
    vector<mint> bunbo = nizyou({1, -p, -mint(1)});
    vector<mint> ans = waru(bunsi, bunbo, 2000000);
    for (int i = 0; i < Q; i++) {
        int q;
        cin >> q;
        cout << ans[q] << '\n';
    }
}