#include <atcoder/all>
using namespace std;
using mint = atcoder::modint1000000007;

int main(){
  int n, k, m;
  cin >> n >> k >> m;
  mint ans, coef = 1, pow[n + 1];
  pow[0] = 1;
  for(int i = 1; i <= n; i++)pow[i] = pow[i - 1] * n;
  for(long long i = 1; i <= n; coef *= n - i++) {
      if(k % i == 0) ans += coef * pow[n - i];
  }
  if(m != 1) ans = (pow[n] - ans) / (n - 1);
  cout << ans.val() << '\n';
}