#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace atcoder;
using mint = modint1000000007;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000001

struct combi{
	deque<mint> kaijou;
	deque<mint> kaijou_;
	
	combi(int n){
		kaijou.push_back(1);
		for(int i=1;i<=n;i++){
			kaijou.push_back(kaijou[i-1]*i);
		}
		
		mint b=kaijou[n].inv();
		
		kaijou_.push_front(b);
		for(int i=1;i<=n;i++){
			int k=n+1-i;
			kaijou_.push_front(kaijou_[0]*k);
		}
	}
	
	mint combination(int n,int r){
		if(r>n)return 0;
		mint a = kaijou[n]*kaijou_[r];
		a *= kaijou_[n-r];
		return a;
	}
	
	mint junretsu(int a,int b){
		mint x = kaijou_[a]*kaijou_[b];
		x *= kaijou[a+b];
		return x;
	}
	
	mint catalan(int n){
		return combination(2*n,n)/(n+1);
	}
	
};

int main(){	
	
	combi C(2000001);
	
	int N,M;
	long long K;
	cin>>N>>K>>M;
	mint ans = 0LL;
	for(long long i=1;i<=N;i++){
		
		
		if(K%i==0){
			mint temp = C.combination(N-1,i-1);
			temp *= C.kaijou[i-1];
			temp *= mint(N).pow(N-i);
			ans += temp;
		}
		
	}
	
	if(1==M){
		cout<<ans.val()<<endl;
		return 0;
	}
	
	ans = mint(N).pow(N) - ans;
	ans /= N-1;
	
	cout<<ans.val()<<endl;
	
    return 0;
}