#include #include #define MOD 1000000007 long long int power(long long int a, long long int b) { long long int ans = 1; long long int k = a; while(b) { if(b%2==1) ans*=k, ans%=MOD; k*=k, k%=MOD; b/=2; } return ans; } long long int inv(long long int k) { return power(k,MOD-2); } std::pair func(long long int a, long long int b, long long int m) { if(b==0) return std::make_pair(0,1); else { if(b%2==0) { std::pair P1 = func(a,b/2,m); std::pair P2; P2.first = (P1.first * P1.second + P1.first * P1.second + (P1.second*P1.second)/m) % MOD; P2.first += (((P1.first*P1.first)%MOD)*m) % MOD, P2.first %= MOD; P2.second = (P1.second*P1.second)%m; return P2; } else { std::pair P1 = func(a,(b-1)/2,m); std::pair P2; P2.first = (P1.first * P1.second + P1.first * P1.second + (P1.second*P1.second)/m) % MOD; P2.first += (((P1.first*P1.first)%MOD)*m) % MOD, P2.first %= MOD; P2.second = (P1.second*P1.second)%m; P2.first *= a, P2.first %= MOD; P2.second *= a, P2.first += (P2.second/m), P2.first %= MOD, P2.second%= m; return P2; } } } long long int ans[100010]; int main() { long long int a,b; scanf("%lld%lld",&a,&b); std::pair C = func(2,b,a); C.second--; if(C.second<0) C.first--, C.second+=a; if(C.first<0) C.first += MOD; long long int A = C.first, B = C.second; if(a%2==0) { for(int i=0;i=t+(a/2)) ans[i] = 2*A+2; else if(B>=t) ans[i] = 2*A+1; else ans[i] = 2*A; } } } else { long long int inv; for(int i=1;i=t) ans[i] = A+1; else ans[i] = A; } } for(int i=0;i