#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

long long pow_mod2(long long x,long long n,int mod)
{
    if(n==0) return 1;
    long long temp = pow_mod2(x*x%mod ,n/2,mod);
    if(n%2==1)
        temp = (temp * x)%mod;
    return temp;
}
int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */
    long long a,b,t;
    cin>>a>>b>>t;
    int mod =1e9+7;
    long long ans=pow_mod2((a+b)/2,t,mod);
    cout<<ans<<endl;
    return 0;
}