// #define DEBUGGING
#include <bits/stdc++.h>
#define endl '\n'
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
using ll = std::int64_t;
using ull = std::uint64_t;
using PLL = std::pair<ll, ll>;
using TLL = std::tuple<ll, ll, ll>;
template <typename T> using V = std::vector<T>;
template <typename T> using VV = V<V<T>>;
template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T> const T& clamp(const T &t, const T &low, const T &high) { return std::max(low, std::min(high, t)); }
template <typename T> void chclamp(T &t, const T &low, const T &high) { return t = clamp(t, low, high); }
namespace init__ { struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } init_io; }
#define mv_rec make_v(init, tail...)
template <typename T> T make_v(T init) { return init; }
template <typename T, typename... Tail> auto make_v(T init, size_t s, Tail... tail) { return V<decltype(mv_rec)>(s, mv_rec); }
#undef mv_rec
using namespace std;

#ifdef DEBUGGING
#include "../../debug/debug.cpp"
#else
#define DEBUG(...) 0
#define DEBUG_SEPARATOR_LINE 0
#endif

const ll mod = 1e9 + 7;

int main() {
    ll P;
    cin >> P;
    ll mat[2][2] = {
        { P, (ll)1, },
        { (ll)1, 0, },
    };

    ll cur[2] = {};

    auto inc = [&](ll v) {
        ll n1 = (mat[0][0] * cur[0] + mat[0][1] * cur[1] + v) % mod;
        ll n2 = (mat[1][0] * cur[0] + mat[1][1] * cur[1]) % mod;
        cur[0] = n1;
        cur[1] = n2;
    };

    inc(0);
    inc(1);

    ll Q;
    cin >> Q;
    V<PLL> query(Q);
    ll a0 = 0, a1 = 1;
    auto inc_a = [&] {
        ll na1 = P * a1 + a0;
        a0 = a1;
        a1 = na1 % mod;
    };
    for (ll i = 0; i < Q; i++) {
        ll q;
        cin >> q;
        query[i] = PLL(q, i);
    }
    sort(ALL(query));
    V<ll> ans(Q);
    ll idx = 3;
    for (auto &&ele : query) {
        ll q, i;
        tie(q, i) = ele;
        while (idx < q) {
            inc_a();
            inc(a1);
            idx++;
        }
        ans[i] = cur[1];
    }

    for (ll i = 0; i < Q; i++) cout << ans[i] << endl;
    return 0;
}