#pragma comment (linker, "/STACK:526000000")
#define  _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"

using namespace std;
typedef string::const_iterator State;
#define eps 1e-11L
#define MAX_MOD 1000000007LL
#define GYAKU 500000004LL

#define MOD 998244353LL
#define seg_size 262144
#define pb push_back
#define mp make_pair
typedef long long ll;
#define REP(a,b) for(long long (a) = 0;(a) < (b);++(a))
#define ALL(x) (x).begin(),(x).end()
unsigned long xor128() {
    static unsigned long x = 123456789, y = 362436069, z = 521288629, w = 88675123;
    unsigned long t = (x ^ (x << 11));
    x = y; y = z; z = w;
    return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}
void init() {
    iostream::sync_with_stdio(false);
    cout << fixed << setprecision(100);
}
#define int ll
long long dp[3000000];
long long ans[3000000];
void solve(){
    int p;
    cin >> p;
    dp[1] = 1;
    for (int i = 2; i < 3e6; ++i) {
        dp[i] = p * dp[i - 1] + dp[i - 2];
        dp[i] %= MAX_MOD;
    }
    ans[2] = 1;
    for (int i = 2; i < 3e6-1; ++i) {
        ans[i + 1] = (ans[i] * p) % MAX_MOD;
        ans[i + 1] += ans[i - 1];
        ans[i + 1] += dp[i];
        ans[i + 1] %= MAX_MOD;
    }
    int query;
    cin >> query;
    REP(i, query) {
        int as;
        cin >> as;
        cout << ans[as-2] << endl;
    }
    return;
}
#undef int
int main() {
    init();
    solve();
}