线性递推BM模板

#include <cstdio>
#include<iostream>
#include <cstring>
#include <cmath>
#include <algorithm>
#include<vector>
#include<assert.h>

using namespace std;
#define rep(i,a,n) for (long long i=a;i<n;i++)
#define per(i,a,n) for (long long i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((long long)(x).size())
typedef vector<long long> VI;
typedef long long ll;
typedef pair<long long,long long> PII;
ll mod=1e9+;
ll powmod(ll a,ll b) {ll res=;a%=mod; assert(b>=); for(;b;b>>=){if(b&)res=res*a%mod;a=a*a%mod;}return res;}
// head

long long _,n;
namespace linear_seq
{
    const long long N=;
    ll res[N],base[N],_c[N],_md[N];

    vector<long long> Md;
    void mul(ll *a,ll *b,long long k)
    {
        rep(i,,k+k) _c[i]=;
        rep(i,,k) if (a[i]) rep(j,,k)
            _c[i+j]=(_c[i+j]+a[i]*b[j])%mod;
        for (long long i=k+k-;i>=k;i--) if (_c[i])
            rep(j,,SZ(Md)) _c[i-k+Md[j]]=(_c[i-k+Md[j]]-_c[i]*_md[Md[j]])%mod;
        rep(i,,k) a[i]=_c[i];
    }
    long long solve(ll n,VI a,VI b)
    { // a 系数 b 初值 b[n+1]=a[0]*b[n]+...
//        printf("%d\n",SZ(b));
        ll ans=,pnt=;
        long long k=SZ(a);
        assert(SZ(a)==SZ(b));
        rep(i,,k) _md[k--i]=-a[i];_md[k]=;
        Md.clear();
        rep(i,,k) if (_md[i]!=) Md.push_back(i);
        rep(i,,k) res[i]=base[i]=;
        res[]=;
        while ((1ll<<pnt)<=n) pnt++;
        for (long long p=pnt;p>=;p--)
        {
            mul(res,res,k);
            if ((n>>p)&)
            {
                for (long long i=k-;i>=;i--) res[i+]=res[i];res[]=;
                rep(j,,SZ(Md)) res[Md[j]]=(res[Md[j]]-res[k]*_md[Md[j]])%mod;
            }
        }
        rep(i,,k) ans=(ans+res[i]*b[i])%mod;
        if (ans<) ans+=mod;
        return ans;
    }
    VI BM(VI s)
    {
        VI C(,),B(,);
        long long L=,m=,b=;
        rep(n,,SZ(s))
        {
            ll d=;
            rep(i,,L+) d=(d+(ll)C[i]*s[n-i])%mod;
            if (d==) ++m;
            else if (*L<=n)
            {
                VI T=C;
                ll c=mod-d*powmod(b,mod-)%mod;
                while (SZ(C)<SZ(B)+m) C.pb();
                rep(i,,SZ(B)) C[i+m]=(C[i+m]+c*B[i])%mod;
                L=n+-L; B=T; b=d; m=;
            }
            else
            {
                ll c=mod-d*powmod(b,mod-)%mod;
                while (SZ(C)<SZ(B)+m) C.pb();
                rep(i,,SZ(B)) C[i+m]=(C[i+m]+c*B[i])%mod;
                ++m;
            }
        }
        return C;
    }
    long long gao(VI a,ll n)
    {
        VI c=BM(a);
        c.erase(c.begin());
        rep(i,,SZ(c)) c[i]=(mod-c[i])%mod;
        return solve(n,c,VI(a.begin(),a.begin()+SZ(c)));
    }
};
 ll phi(ll n)
{
     ll i,rea=n;
     for(i=;i*i<=n;i++)
     {
         if(n%i==)
         {
             rea=rea-rea/i;
             while(n%i==)
                 n/=i;
          }
     }
     if(n>)
         rea=rea-rea/n;
     return rea;
}
ll ksm(ll a,ll b,ll p){
    ll ret=;
    while(b){
        if(b&){
            ret=ret*a%p;
        }
        b>>=;
        a=a*a%p;
    }
    return ret;
}
ll a,b;
VI f;
int fr[];
int main()
{
    ll x,y,n,m,ans,i;
    while(scanf("%lld%lld%lld",&a,&b,&n)!=EOF){
        if(n==){
            cout<<a<<endl;
            continue;
        }
        if(n==){
            cout<<b<<endl;
            continue;
        }
        mod=phi(1e9+);
        f.clear();
        fr[]=;
        fr[]=;
        f.push_back(fr[]);
        f.push_back(fr[]);
        for(int i=;i<=;i++){
            fr[i]=fr[i-]+fr[i-]%mod;
            f.push_back(fr[i]);
        }
        ll p1=linear_seq::gao(f,n-);
        ll p2=linear_seq::gao(f,n-);

        //phi与ksm是降幂的
        ll k1=ksm(a,p1+mod,1e9+);
        ll k2=ksm(b,p2+mod,1e9+);
        ll pp=1e9+;
        ll ans=k1*k2%(pp);
        printf("%I64d\n",ans);
    }
}