#ifdef NACHIA
#define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <array>
#include <cmath>
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<int(n); i++)
#define repr(i,n) for(int i=int(n)-1; i>=0; i--)
const i64 INF = 1001001001001001001;
#include <atcoder/modint>
using Modint = atcoder::static_modint<10000'00007>;
using namespace std;

void testcase(){
    Modint P; { int p; cin >> p; P = p; }
    vector<Modint> D(5);
    D[1] = P * 2;
    D[2] = -P*P + 2;
    D[3] = -P * 2;
    D[4] = -1;
    int Z = 2000100;
    vector<Modint> A(Z);
    A[4] = 1;
    for(int i=5; i<Z; i++) rep(j,4) A[i] += A[i-j-1] * D[j+1];
    int Q; cin >> Q;
    rep(q,Q){ int a; cin >> a; cout << A[a].val() << '\n'; }
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    testcase();
    return 0;
}