1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
#include <bits/stdc++.h>
using namespace std;
#define fwd(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n)    fwd(i, 0, n)
#define all(X)       X.begin(), X.end()
#define sz(X)        int(size(X))
#define pb           push_back
#define eb           emplace_back
#define st           first
#define nd           second
using pii = pair<int, int>;
using vi = vector<int>;
using ll = long long;
using ld = long double;
#ifdef LOC
auto SS = signal(6, [](int) {
	*(int *)0 = 0;
});
#	define DTP(x, y)                                      \
		auto operator<<(auto &o, auto a)->decltype(y, o) { \
			o << "(";                                      \
			x;                                             \
			return o << ")";                               \
		}
DTP(o << a.st << ", " << a.nd, a.nd);
DTP(for (auto i : a) o << i << ", ", all(a));
void dump(auto... x) {
	((cerr << x << ", "), ...) << '\n';
}
#	define deb(x...) cerr << setw(4) << __LINE__ << ":[" #x "]: ", dump(x)
#else
#	define deb(...) 0
#endif

const int MOD = 1e9 + 7;

ll mod_pow(ll a, ll b) {
	ll res = 1;
	while (b) {
		if (b & 1) {
			res = (res * a) % MOD;
		}
		a = (a * a) % MOD;
		b /= 2;
	}
	return res;
}

ll mod_inv(ll a) {
	return mod_pow(a, MOD - 2);
}

int32_t main() {
	cin.tie(0)->sync_with_stdio(0);
	ll n, k, m;
	cin >> n >> k >> m;
	ll prob_wypadniecia = mod_inv(k);
	vector<ll> prob_przebicia(m + 1);
	fwd(i, max(0, int(m - k)), m + 1) prob_przebicia[i] =
		((i - m + k + 1) * prob_wypadniecia) % MOD;
	vector<ll> prob_zahaczenia(m + 1);
	{
		prob_zahaczenia[0] = 1;
		ll suma_ziutkow = 0;

		fwd(i, 1, m + 1) {
			suma_ziutkow = (suma_ziutkow + prob_zahaczenia[i - 1]) % MOD;
			if (i > k) {
				suma_ziutkow =
					(suma_ziutkow - prob_zahaczenia[i - k - 1] + MOD) % MOD;
			}
			prob_zahaczenia[i] = (suma_ziutkow * prob_wypadniecia) % MOD;
		}
	}
	vector<ll> dozyje(m + 1);
	for (int i = int(m - 1); i >= 0; i--) {
		dozyje[i] =
			(dozyje[i + 1] + prob_przebicia[i] * prob_zahaczenia[i]) % MOD;
	}
	ll exp_tot = 0;
	rep(i, m) {
		if (i < m - k) {
			exp_tot = (exp_tot + n * prob_zahaczenia[i]) % MOD;
		} else {
			ll p_ro =
				((mod_pow(dozyje[i], n) - mod_pow(dozyje[i + 1], n) + MOD) *
				 mod_inv(prob_przebicia[i])) %
				MOD;
			exp_tot = (exp_tot + p_ro) % MOD;
		}
	}
	cout << exp_tot << "\n";
#ifdef LOCF
	cout.flush();
	cerr << "- - - - - - - - -\n";
	(void)!system(
		"grep VmPeak /proc/$PPID/status | sed s/....kB/\' MB\'/1 >&2"); // 4x.kB
																		// ....kB
#endif
	return 0;
}