x, y = map(int, input().split())
n = int(input())
lst = [x, y]
i = 1
while i < 6:
p = lst[i] - lst[i-1]
lst.append(p)
i += 1
ans = lst[(n-1)%6]
print(ans%(10**9 + 7))#include <bits/stdc++.h>
using namespace std;
const int num=1e9+7;
int main()
{
int x,y;
cin>>x>>y;
long long n;cin >>n;
if(x<0)
x+=num;
if(y<0)
y+=num;
int z=(y%num-x%num +num)%num;
int rem=n%6;
if(rem==0)
cout<<(-z+num)%num<<"\n";
if(rem==1)
cout<<x<<"\n";
if(rem==2)
cout<<y<<"\n";
if(rem==3)
cout<<z<<"\n";
if(rem==4)
cout<<(-x+num)%num<<"\n";
if(rem==5)
cout<<(-y+num)%num<<"\n";
}
43. Multiply Strings | 34. Find First and Last Position of Element in Sorted Array |
33. Search in Rotated Sorted Array | 17. Letter Combinations of a Phone Number |
5. Longest Palindromic Substring | 3. Longest Substring Without Repeating Characters |
1312. Minimum Insertion Steps to Make a String Palindrome | 1092. Shortest Common Supersequence |
1044. Longest Duplicate Substring | 1032. Stream of Characters |
987. Vertical Order Traversal of a Binary Tree | 952. Largest Component Size by Common Factor |
212. Word Search II | 174. Dungeon Game |
127. Word Ladder | 123. Best Time to Buy and Sell Stock III |
85. Maximal Rectangle | 84. Largest Rectangle in Histogram |
60. Permutation Sequence | 42. Trapping Rain Water |
32. Longest Valid Parentheses | Cutting a material |
Bubble Sort | Number of triangles |
AND path in a binary tree | Factorial equations |
Removal of vertices | Happy segments |
Cyclic shifts | Zoos |