#include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using ll = long long; const ll modc = 1e9+7; class mint { ll x; public: mint(ll x=0) : x((x%modc+modc)%modc) {} mint operator-() const { return mint(-x); } mint& operator+=(const mint& a) { if ((x += a.x) >= modc) x -= modc; return *this; } mint& operator-=(const mint& a) { if ((x += modc-a.x) >= modc) x -= modc; return *this; } mint& operator*=(const mint& a) { (x *= a.x) %= modc; return *this; } mint operator+(const mint& a) const { mint res(*this); return res+=a; } mint operator-(const mint& a) const { mint res(*this); return res-=a; } mint operator*(const mint& a) const { mint res(*this); return res*=a; } mint pow(ll t) const { if (!t) return 1; mint a = pow(t>>1); a *= a; if (t&1) a *= *this; return a; } mint inv() const { return pow(modc-2); } mint& operator/=(const mint& a) { return (*this) *= a.inv(); } mint operator/(const mint& a) const { mint res(*this); return res/=a; } bool operator == (const mint& a) const{ return x == a.x; } friend ostream& operator<<(ostream& os, const mint& m){ os << m.x; return os; } friend istream& operator>>(istream& ip, mint&m) { ip >> m.x; return ip; } }; vector> dot(vector> &a, vector> &b){ int M = a.size(); vector> c(M, vector(M)); for (int i=0; i> pow(vector> A, ll N){ int M = A.size(); vector> B(M, vector(M)); for (int i=0; i>= 1; A = dot(A, A); } return B; } int main(){ ll C, N, M; cin >> C >> N >> M; vector> B(4, vector(4)), D; mint a = mint(C).inv(), p; B[0][0] = a; B[0][3] = a; B[1][1] = a; B[1][2] = a*(C-1); B[1][3] = a*(C-2); B[2][0] = 1; B[3][1] = 1; D = pow(B, N-1); p = a*D[0][0] + D[0][2]; cout << mint(1) - mint(-p+1).pow(M) << endl; }