#include using namespace std; #define fs first #define sc second #define pb push_back #define mp make_pair #define eb emplace_back #define ALL(A) A.begin(),A.end() #define RALL(A) A.rbegin(),A.rend() typedef long long LL; typedef pair P; template inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } template T gcd(T a,T b){return b?gcd(b,a%b):a;} const LL mod=1000000007; const LL LINF=1LL<<62; const int INF=1<<30; int dx[]={1,0,-1,0,1,-1,1,-1}; int dy[]={0,1,0,-1,1,-1,-1,1}; typedef vector> mat; mat mul(mat A,mat B){ mat C(A.size(),vector (B[0].size())); for(int i=0;i (A.size())); for(int i=0;i0){ if(n&1) B=mul(B,A); A=mul(A,A); n>>=1; } return B; } int main(){ int p,k;cin >> p >> k; mat A(2,vector (2,0)); mat h(2,vector (1,0)); h[0][0] = 1; A[0][0] = p + 1; A[0][1] = 2 * (p - 1); A[1][0] = 1; A[1][1] = 2 * (p - 1); auto Ak = pow(A, k); auto ans = mul(Ak, h); cout << ans[0][0] << endl; return 0; }