#include <bits/stdc++.h>
#include <string>
#include <sstream>
using namespace std;

typedef long long ll;
typedef unsigned int ul;
typedef unsigned long long ull;
typedef vector <int> vi;
typedef vector <char> vc;
typedef map<string,string> mss;
typedef map<int, vector<int> > mvii;
typedef map<int, int> mii;
typedef queue <int> qi;
typedef map <int, vector<string> > mvis;
typedef map <string, vector<int> > mvsi;
typedef vector <string> vs;
typedef pair <int, int> pii;

#define MP make_pair
#define all(c) c.begin(),c.end() 
#define present(container,element)  (container.find(element)!=container.end())                        // for set and map.
#define cpresent(container,element) (find(all(container),element)!=container.end())
#define SORT(a) sort (a.begin(), a.end())
#define REVERSE(a) reverse (a.begin(), a.end())
#define PI acos(-1)
#define ms(x,y) memset (x, y, sizeof(x))
#define INF 2000000000
#define pb push_back
#define MAX 5000000
#define debug cout<<"A"<<endl
#define prnt(a) cout<<a<<endl
#define modi 1000000007
#define FOR(i,a,b) for(int i=(a); i<(b); i++)
#define FORr(i,a,b) for(int i=(a); i>=b; i--)
#define tr(c,itr) for(__typeof((c).begin()) itr=(c).begin();itr!=(c).end();itr++)

/* Direction Array */

// int fx[]={1,-1,0,0};
// int fy[]={0,0,1,-1};
// int fx[]={0,0,1,-1,-1,1,-1,1};
// int fy[]={-1,1,0,0,1,1,-1,-1};

template <class T> inline T bigmod(T p,T e,T M)
{
    ll ret = 1;
    for(; e > 0; e >>= 1)
    {
        if(e & 1) ret = (ret * p) % M;
        p = (p * p) % M;
    } return (T)ret;
}

template <class T> inline T gcd(T a,T b){if(b==0)return a;return gcd(b,a%b);}
template <class T> inline T modinverse(T a,T M){return bigmod(a,M-2,M);}
template <class T> inline T lcm(T a,T b) {a=abs(a);b=abs(b); return (a/gcd(a,b))*b;}
template <class T, class X> inline bool getbit(T a, X i) { T t=1; return ((a&(t<<i))>0);}
template <class T, class X> inline T setbit(T a, X i) { T t=1;return (a|(t<<i)); }
template <class T, class X> inline T resetbit(T a, X i) { T t=1;return (a&(~(t<<i)));}



// To compute x^y under modulo m
long long int power(long long int x, unsigned long long int y, unsigned long long int m)
{
    if (y == 0)
        return 1;
    long long int p = power(x, y/2, m) % m;
    p = (p * p) % m;
 
    return (y%2 == 0)? p : (x * p) % m;
}
 
// Function to find modular inverse of a under modulo m
// Assumption: m is prime
ll modInverse(long long int a, long long int m)
{
    long long int g = gcd(a, m);
    if (g != 1)
        cout << "Inverse doesn't exist";
    
        // If a and m are relatively prime, then modulo inverse
        // is a^(m-2) mode m
        return  power(a, m-2, m);
    
}
 

// Function to return gcd of a and b
long long int gcd(long long int a, long long int b)
{
    if (a == 0)
        return b;
    return gcd(b%a, a);
}







int main (){
	
	ll a,b,t;
	cin >> a>> b>>t;
	//cout << pow(2,18);
	//cout << modInverse(pow(2,18),1000000007)<< endl;
	
	ll res1 = (bigmod<ll>((a+b)/2,t, 1000000007)) % 1000000007;
	//ll res2 = (bigmod<ll>(b/2,t, 1000000007)) % 1000000007;
	//ll res = (res1+res2)% 1000000007;
 cout << res1<< endl;
 return 0;
	
}