#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;
int main(){
    int M = 2000001;
    int p;
    cin>>p;
    assert(1<=p && p<=1000000000);
    vector<ll> ans(M),a(M);
    a[2]=1;
    for(int i=3;i<M;i++){
        ans[i]=(p*ans[i-1]+ans[i-2]+a[i-2])%mod;
        a[i]=(p*a[i-1]+a[i-2])%mod;
    }
    int q;
    cin>>q;
    assert(1<=q && q<=200000);
    rep(i,q){
        int x;
        cin>>x;
        assert(1<=x && x<=2000000);
        cout<<ans[x]<<endl;
    }
    return 0;
}