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

//int power(int, long long int);
int powerMod(unsigned long long int, unsigned long long int, unsigned long long int);

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */  
    unsigned long long int a, b;
    unsigned long long int t;
    cin>>a>>b>>t;
    int fraction = (a+b)/2;
    unsigned long long int expectedCells = powerMod(fraction,t,1000000007);
    cout<<expectedCells;
    return 0;
}

/*
int power(int x, long long int y){
    if( y == 0)
        return 1;
    else if (y%2 == 0)
        return (power(x, y/2)*power(x, y/2))%(1000000007);
    else
        return (x*power(x, y/2)*power(x, y/2))%(1000000007);
 
}
*/

int powerMod(unsigned long long int x, unsigned long long int y, unsigned long long int p)
{
    unsigned long long int res = 1;      // Initialize result
 
    x = x % p;  // Update x if it is more than or 
                // equal to p
 
    while (y > 0)
    {
        // If y is odd, multiply x with result
        if (y & 1)
            res = (res*x) % p;
 
        // y must be even now
        y = y>>1; // y = y/2
        x = (x*x) % p;  
    }
    return res;
}