#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#define mod 1000000007
using namespace std;
unsigned long long int poweer(unsigned long long int x, unsigned long long int y)
{
    unsigned long long int res = 1;      // Initialize result
 
    x = x % mod;  // 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) % mod;
 
        // y must be even now
        y = y>>1; // y = y/2
        x = (x*x) % mod;  
    }
    return res;
}
int main() {
    
    unsigned long long int a,b,t,cells;
    cin>>a>>b>>t;
    unsigned long long int res=(poweer((a+b)/2,t));
    cout<<res;
    
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    return 0;
}