#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
#define d 1000000007
#define ll long long int
long long int power(long long int x, long long int y)
{
	if (y == 0)
		return 1;
	long long int p = power(x, y/2) % d;
	p = (p * p) % d;

	return (y%2 == 0)? p : (x * p) % d;
}
ll modInverse(ll a)
{
		return  power(a, d-2);
	
}


int main() {
    ll a,b;
    long long int t,N1 , N2,N3;
    cin>>a>>b>>t;
    N1=power((a+b),t);
    N2 = power(2 , t);
    N3 = modInverse(N2);
    ll ans = (N1 * N3) % d;
    cout<<ans<<endl;
    return 0;
}