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

template <typename T>
T modpow(T base, T exp, T modulus) {
  base %= modulus;
  T result = 1;
  while (exp > 0) {
    if (exp & 1) result = (result * base) % modulus;
    base = (base * base) % modulus;
    exp >>= 1;
  }
  return result;
}


int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */  
    long long int a,b,t,sum;
    cin>>a>>b>>t;
    sum=0.5*a+0.5*b;
    sum=modpow<long long int>(sum,t,1000000007);
    cout<<sum;
    return 0;
}