Jzzhu and Sequences （周赛3）

Jzzhu has invented a kind of sequences, they meet the following property:

You are given x and y, please calculate f_n modulo 1000000007 (10⁹ + 7).

Input

The first line contains two integers x and y (|x|, |y| ≤ 10⁹). The second line contains a single integer n (1 ≤ n ≤ 2·10⁹).

Output

Output a single integer representing f_n modulo 1000000007 (10⁹ + 7).

Sample test(s)

Input

2 3
3

Output

1

Input

0 -1
2

Output

1000000006

Note

In the first sample, f₂ = f₁ + f₃, 3 = 2 + f₃, f₃ = 1.

In the second sample, f₂ =  - 1;  - 1 modulo (10⁹ + 7) equals (10⁹ + 6).

规律：六个一循环。

#include<iostream>
#include <stdio.h>

using namespace std;

int main()
{
  long long  a[6];
  int n,x,y;

  while(~scanf("%d%d",&x,&y))
  {
     a[1]=x;
	 a[2]=y;
	 a[3]=y-x;
	 a[4]=-x;
	 a[5]=-y;
	 a[0]=x-y;

	 scanf("%d",&n);
	 n=n%6;

	 while(a[n]<0)
		 a[n]=a[n]+1000000007;

		 printf("%lld\n",a[n]%1000000007);
  }
return 0;
}