#include <bits/stdc++.h> #define ll long long using namespace std; const ll mod = 1e9 + 7; ll modpow(ll a, ll b, ll mod) { ll result = 1; a %= mod; while (b > 0) { if (b % 2 == 1) { result = (result * a) % mod; } b /= 2; a = (a * a) % mod; } return result; } void sub1(ll c, ll k) { vector<int> x; while (k > 0) { x.push_back(c % 10); c /= 10; k--; } for (int i = x.size() - 1; i >= 0; i--) { cout << x[i]; } } int main() { freopen("CHUSO.INP","r",stdin); freopen("CHUSO.OUT","w",stdout); ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ll k, n, m; cin >> k >> n >> m; ll c = modpow(n, m, mod); sub1(c, k); return 0; }