#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int,int> P;
ll const mod = 1e9+7;

#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();;++(it)) {if ((it) == map.end()) {cout << "}\n";break;}else cout << "" << (it)->first << "=>" << (it)->second << ", ";}}while(0)

int main() {
    ll p;
    int q;
    cin >> p;
    vector<ll> ans(2000010),a(2000010);
    a[1] = 0;
    a[2] = 1;
    for (int i = 3;i < 2000010;++i) a[i] = (p*a[i-1]+a[i-2])%mod;
    ans[1] = 0;
    ans[2] = 0;
    for (int i = 3;i < 2000010;++i) ans[i] = (p*ans[i-1]+ans[i-2]+a[i-2])%mod;
    cin >> q;
    for (int i = 0;i < q;++i) {
        int t;
        cin >> t;
        cout << ans[t] << "\n";
    }
}