#include #include using namespace std; typedef long long ll; typedef pair P; typedef pair T; long long int INF = 1e17; const ll fact_table = 800008; double Pi = 3.1415926535897932384626; priority_queue pql; priority_queue

pqp; //big priority queue priority_queue ,greater > pqls; // priority_queue ,greater

> pqps; //small priority queue //top pop ll dx[8]={1,0,-1,0,1,1,-1,-1}; ll dy[8]={0,1,0,-1,1,-1,-1,1}; char dir[] = "DRUL"; //↓,→,↑,← #define p(x) cout< number2){ swap(number1,number2); } if(number1 == 0 || number1 == number2){ return number2; }else{ return gcd(number2 % number1,number1); } } void YES(bool condition){ if(condition){ p("YES"); }else{ p("NO"); } return; } void Yes(bool condition){ if(condition){ p("Yes"); }else{ p("No"); } return; } /* ll fact[fact_table + 5],rfact[fact_table + 5]; void c3_init(){ fact[0] = rfact[0] = 1; for(ll i=1; i<=fact_table; i++){ fact[i] = (fact[i-1]*i) % mod; } rfact[fact_table] = rui(fact[fact_table],mod - 2); for(ll i=fact_table; i>=1; i--){ rfact[i-1] = rfact[i] * i; rfact[i-1] %= mod; } return;} ll c3(ll n,ll r){ return (((fact[n] * rfact[r]) % mod ) * rfact[n-r]) % mod;} */ ll n,m,num,sum,ans,a,b,c,d,e,h,r,l,q; ll k; ll x[2000005], y[2000005]; vector G[500005]; ll dp[500005]; ll query[2000005]; int main(){ cin >> k; cin >> q; for(ll i=0;i> query[i]; } x[2] = 0; x[3] = 0; x[4] = 1; y[2] = 1; y[3] = k % mod; for(ll i=5;i<=2000000;i++){ y[i-1] = (y[i-2] * k) % mod + y[i-3] % mod; x[i] = ((k * x[i-1] % mod) + x[i-2] + y[i-2]) % mod; } for(ll i=0;i