#include using namespace std; #define all(a)a.begin(),a.end() #define rall(a)a.rbegin(),a.rend() using ll=long long; const int INF = 1<<30; const ll INFll =1LL<<62; const int mod= int(1e9)+7; const int mod2=998244353; using P = pair; using Pl= pair; using ld=long double; using V=vector; using Vl=vector; using Vd=vector; using VV=vector>; using VVl=vector>; using VVd=vector>; // modint: mod 計算を int を扱うように扱える構造体 template struct Fp { long long val; constexpr Fp(long long v = 0) noexcept : val(v % MOD) { if (val < 0) val += MOD; } constexpr int getmod() { return MOD; } constexpr Fp operator - () const noexcept { return val ? MOD - val : 0; } constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; } constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; } constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; } constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; } constexpr Fp& operator += (const Fp& r) noexcept { val += r.val; if (val >= MOD) val -= MOD; return *this; } constexpr Fp& operator -= (const Fp& r) noexcept { val -= r.val; if (val < 0) val += MOD; return *this; } constexpr Fp& operator *= (const Fp& r) noexcept { val = val * r.val % MOD; return *this; } constexpr Fp& operator /= (const Fp& r) noexcept { long long a = r.val, b = MOD, u = 1, v = 0; while (b) { long long t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } val = val * u % MOD; if (val < 0) val += MOD; return *this; } constexpr bool operator == (const Fp& r) const noexcept { return this->val == r.val; } constexpr bool operator != (const Fp& r) const noexcept { return this->val != r.val; } friend constexpr ostream& operator << (ostream &os, const Fp& x) noexcept { return os << x.val; } friend constexpr Fp modpow(const Fp &a, long long n) noexcept { if (n == 0) return 1; auto t = modpow(a, n / 2); t = t * t; if (n & 1) t = t * a; return t; } }; using mint = Fp; using Vm=vector; Vm even(Vm P){ Vm R; int n=P.size(); for (int i = 0; i 0){ Vm U=mul(P,mi(Q)); if(n%2==0)P=even(U); else P=odd(U); Q=even(mul(Q,mi(Q))); n/=2; } return P[0]/Q[0]; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); ll p;cin >>p; ll t;cin >>t; Vm P={0,0,1}; Vm Q={1,-p,-1}; Q=mul(Q,Q); while(t--){ int q;cin >>q; cout<