During the World Cup 2014 qualifications, Serbia national football team had an interesting strategy. They were starting each attack by passing the ball from the player with the number N₁ to the player with the number N₂. Each following pass was to the player whose number equals the absolute value of the difference between the numbers of the two players previously having the ball. More formally, after the player N_i-2 passes the ball to the player N_i-1, the next player to receive the ball is the player N_i = |N_i-2 – N_i-1|.

This strategy, surprisingly, did not prove itself to be a useful one. Nevertheless, it made fans ponder who will be the K-th player to get the ball, given that the attack actually lasts long enough.

Input

The single line of input contains three non-negative integers, N₁, N₂ (0 <= N₁, N₂ < 2⁶³), and K (1 <= K < 2⁶³).

In 20% of test cases K < 2¹⁵.

Output

The single line of output should contain the number Nk.

Constraints

Time limit: 500 milliseconds
Memory limit: 64 megabytes

Examples

input
37 16 8

output
6

input
17254968996716914 5030751795369479754 2731091466

output
2019640987948

Example 1: The players received the ball in the following order:

37, 16, 21, 5, 16, 11, 5, 6, 1, 5, 4, 1, 3, 2, 1, 1, 0, 1, 1, 0, ...

The eight player to receive the ball is the player with the number 6.