#include <stdio.h>
#define ll long long
#define mod 1000000007
int main(){
ll x,y,n,a[10];
while(~scanf("%lld%lld%lld",&x,&y,&n)){
a[0]=x-y;
a[1]=x;
a[2]=y;
a[3]=y-x;
a[4]=-x;
a[5]=-y;
n%=6;
a[n]%=mod;
while(a[n]<0)
a[n]+=mod;
printf("%lld\n",a[n]%mod);
}
return 0;
}
矩阵快速幂: