#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long int ll;
ll mod=1000000007LL;

ll lpow(ll n,ll x){
    ll res=1;
    while(x>0){
        
        if(x%2 == 1){
            res*=n;
            res%=mod;
        }
        
        n=n*n;
        n%=mod;
        x/=2;
    }
    return res;
}

int main() {
    
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    
    ll a,b,t;
    cin>>a>>b>>t;
    ll ans=lpow(a+b,t);
    ans%=mod;
    ll temp=lpow(2,t);
    ans*=lpow(temp,mod-2);
    ans%=mod;
    printf("%lld",ans);
    return 0;
}