#pragma GCC optimize("O3")
#include <algorithm>

#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define endl '\n'
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))

using namespace std;



template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}

const int INF=1e9;

const ll mod = 1e9+7;

long double pow_d(long double val,ll t){
    if (!t) return 1.0;
    long double a = pow_d(val,t>>1);
    a *= a;
    ll num=a;
    if(num>mod){
        ll k=num/mod;
        long double ab=k;
        long double m=mod;
        a-=ab*m;
    }
    if (t&1) a *=val;
    num=a;
    if(num>mod){
        ll k=num/mod;
        long double ab=k;
        long double m=mod;
        a-=ab*m;
    }
    return a;
}

int main(){
    ll a,b,n;
    cin >> a >> b >> n;
    long double A=a,B=b;
    long double c=A+sqrt(B),d=A-sqrt(B);
    long double m=mod;
    if(d<0) d+=m;
    long double p=pow_d(c,n),q=pow_d(d,n);
    long double ans=p+q;
    ll v=round(ans);
    v%=mod;
    cout << v << endl;
    return 0;
}