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

long long fast_pow(int a,long long n)
{
    long long result = 1;
    long long power = n;
    long long value = a;
    while(power>0)
    {
        if(power&1)
            {
                result = result*value;
                result = result%1000000007;
            }
        value = value*value %1000000007;
        //value = value%1000000007;
        power /= 2;
        //power >>= 1;
    }
    return result;
}



int main()
{
    long long a,b,t;
    cin>>a>>b>>t;
    cout<<fast_pow((long long)(0.5*(a+b)),t);
}