#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using PII = std::pair<int, int>;
using PLL = std::pair<ll, ll>;

#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--)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define allpt(v) (v).begin(), (v).end()
#define allpt_r(v) (v).rbegin(), (v).rend()


const int mod = 1e9 + 7;
const string wsp = " ";
const string tb = "\t";
const string rt = "\n";

template <typename T>
void show1dvec(vector<T> v)
{
    int n = v.size() - 1;
    rep(i, n) cout << v[i] << wsp;
    cout << v[n] << rt;
    return;
}

template <typename T>
void show2dvec(vector<vector<T>> v)
{
    int n = v.size();
    rep(i, n) show1dvec(v[i]);
}

int main()
{

#ifdef DEBUG
    cout << "DEBUG MODE" << endl;
    ifstream in("input.txt"); //for debug
    cin.rdbuf(in.rdbuf());    //for debug
#endif

    const int n = 2e6+10;
    ll p, q, x, s = 0, ans = 0;
    cin >> p >> q;
    vector<ll> f(n), sf(n, 0);
    f[0] = 0, f[1] = 1;
    rep(i, n - 2)
    {
        f[i + 2] = (p * f[i + 1] + f[i]) % mod;
    }

    rep2(i, 1, n - 3)
    {
        sf[i + 3] = (p * sf[i + 2]) % mod;
        sf[i + 3] += sf[i + 1] + f[i];
        sf[i + 3] %= mod;
    }

    rep(i, q)
    {
        cin >> x;
        cout << sf[x] << rt;
    }

    return 0;
}