#include #ifdef _DEBUG #include "debug.hpp" #else #define debug(...) #endif #define REP(i, m, n) for(int i = (int)(m); i < (int)(n); ++i) #define rep(i, n) REP(i, 0, n) #define rrep(i, n) for(int i = (int)(n)-1; i >= 0; --i) #define whole(x) (x).begin(), (x).end() #define fi first #define se second #define int long long using namespace std; using ll = long long; using P = pair; using ld = long double; constexpr int INF = 1LL<<60; constexpr long long LINF = 1LL<<60; template inline bool chmax(T &a, const U &b) { if(a < b) { a = b; return true; } return false; } template inline bool chmin(T &a, const U &b) { if(a > b) { a = b; return true; } return false; } constexpr int MOD = 1e9+7; //constexpr int MOD = 998244353; struct mint { long long x; mint(long long x = 0) noexcept : x((x%MOD + MOD) % MOD) {} // basis mint operator-() const { return mint(-x); } mint& operator+=(const mint a) noexcept { if((x += a.x) >= MOD) x -= MOD; return *this; } mint& operator-=(const mint a) noexcept { if((x += MOD-a.x) >= MOD) x -= MOD; return *this; } mint& operator*=(const mint a) noexcept { (x *= a.x) %= MOD; return *this; } mint operator+(const mint a) const noexcept { return mint(*this) += a; } mint operator-(const mint a) const noexcept { return mint(*this) -= a; } mint operator*(const mint a) const noexcept { return mint(*this) *= a; } mint mpow(long long t) const noexcept { if(!t) return 1; mint a = mpow(t>>1); a *= a; if(t&1) a *= *this; return a; } // for prime MOD mint inv() const noexcept { return mpow(MOD-2); } mint& operator/=(const mint a) noexcept { return *this *= a.inv(); } mint operator/(const mint a) const noexcept { return mint(*this) /= a; } // comparison bool operator==(const mint &a) const noexcept { return this->x == a.x; } bool operator!=(const mint &a) const noexcept { return this->x != a.x; } // I/O stream friend istream& operator>>(istream& is, mint& a) noexcept { return is >> a.x; } friend ostream& operator<<(ostream& os, const mint& a) noexcept { return os << a.x; } }; // additional mint mpow(const long long &a, long long n) noexcept { return mint(a).mpow(n); } mint mpow(const mint &a, long long n) noexcept { return a.mpow(n); } int p, k; mint dp[1000100][2]; signed main() { cin.tie(0); ios::sync_with_stdio(false); cin >> p >> k; dp[0][0] = 1; rep(i, k) { dp[i+1][0] += dp[i][1]+dp[i][0]+dp[i][0]*p+dp[i][1]; dp[i+1][1] += dp[i][0]*(p-1)+dp[i][1]*(p-1)+dp[i][1]*(p-1); } cout << dp[k][0] << '\n'; return 0; }