#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
#define mod 1000000007

long long int modfun(long long int a,long long int b)
{
     long long int result = 1;
    while (b > 0)
       {
           if (b & 1)
           {
               a=a%mod;
               result = (result * a)%mod;
               result=result%mod;
           }
        b=b>>1;
        a=a%mod;
        a = (a*a)%mod;
        a=a%mod;
       }
    return result;
}

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */  
    long long sum,a,b;
    long long t,d,s,i;
    cin>>a>>b>>t;
    sum=(a+b)*0.5;
    if(sum==0)
            cout<<0<<"\n";
           else if(t==0)
            cout<<1<<"\n";
           else if(t==1)
            cout<<sum%mod<<"\n";
           else
           {
               cout<<(modfun(sum,t))%mod<<"\n";
           }
    /*d=sum;
    while(m>pow(sum,s)){
        s++;
    }
    for(i=0;i<t;i+=5){
        sum*=pow(d,100)%m;
    }
    i-=s;
    while(i<t)
        sum*=d;
    cout<<sum;*/
    return 0;
}