#include <iostream>
#include <atcoder/modint>

namespace ac = atcoder;

using lint = long long;
using mint = ac::modint1000000007;

void solve() {
    int n, m;
    lint k;
    std::cin >> n >> k >> m;

    // m = 1
    mint ans1 = 0, fact = 1;
    for (int d = 1; d <= n; ++d) {
        if (k % d == 0) ans1 += fact * mint(n).pow(n - d);
        fact *= n - d;
    }

    if (m == 1) {
        std::cout << ans1.val() << "\n";
    } else {
        std::cout << ((mint(n).pow(n) - ans1) / (n - 1)).val() << "\n";
    }
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}