/* 
 * C++ Program to Implement Modular Exponentiation Algorithm
 */
#include <iostream>
#define ll long long
using namespace std; 
 
/* 
 * Function to calculate modulus of x raised to the power y 
 */
ll modular_pow(ll base, ll exponent, int modulus)
{
    ll result = 1;
    while (exponent > 0)
    {
        if (exponent % 2 == 1)
            result = (result * base) % modulus;
        exponent = exponent >> 1;
        base = (base * base) % modulus;
    }
    return result;
}
/* 
 * Main
 */
int main()
{
    ll a, b, x, t;
    int mod=1000000007;
    cin >> a >> b >> t;
    x = (a+b)/2;

    cout<<modular_pow(x, t , mod)<<endl;
    return 0;
}