#include<bits/stdc++.h>

using namespace std;
using ll=long long;
#define rep2(i, a, n) for(int i = (a); i < (n); i++)
#define rep(i, n) rep2(i,0,n)
#define mod 1000000007

ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}

int a,b,n;

ll dfs(int r,int g){
  if(r==n)return g;
  ll res=1;
  rep2(i,a,b+1){
    res*=dfs(r+1,gcd(g,i));
    res%=mod;
  }
  return res;
}

int main(){
  cin.tie(nullptr);ios_base::sync_with_stdio(false);
  cin>>a>>b>>n;
  cout<<dfs(0,0)<<endl;
}