#include<iostream>
#include <stdio.h>
#include<algorithm>

using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define pb push_back
#define mp make_pair
typedef long long ll;
ll binPow(ll a, ll q, ll MOD) {
    a %= MOD;
    if (q == 0) return 1;
    return ((q % 2 == 1 ? a : 1) * binPow(a * a, q / 2, MOD)) % MOD;
}
int main()
{
    
	int a,b;
	scanf("%d%d",&a,&b);
	ll t;
	scanf("%lld",&t);
	
	printf("%d\n", (int)binPow( (a+b)/2,t,1000000000+7 ) );
	
	return 0;
}