Codeforces 450B. Jzzhu and Sequences（1ni）（规律水题）

B. Jzzhu and Sequences

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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

You are given x and y, please calculate fn modulo 1000000007 (109 + 7).

Input

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

Output

Output a single integer representing fn modulo 1000000007 (109 + 7).

Examples

input

Copy

2 3
3

output

Copy

1

input

Copy

0 -1
2

output

Copy

1000000006

Note

In the first sample, f2 = f1 + f3, 3 = 2 + f3, f3 = 1.

In the second sample, f2 =  - 1;  - 1 modulo (109 + 7) equals (109 + 6).

思路：暴力出来可以发现六个一组，规律就找出来了

#include<bits/stdc++.h>
using namespace std;
const double eps = 1.0e-6; //浮点

long long x,y,n; 
long long a[105];
int main()
{
	cin >> x >> y >> n;
	a[1]=(x+1000000007)%1000000007 ;
	a[2]=(y+1000000007)%1000000007 ;
	for(int i=3;i<=6;i++)
	{
		a[i] = a[i-1] - a[i-2];
		a[i] = (a[i]+ 1000000007) % 1000000007 ;
	}
	n %= 6;
	if(n==0) cout << a[6] << endl;
	else cout << a[n] << endl;
}