Problem B. Jzzhu and Sequences

时间限制 1 ms   内存限制 256 MB

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).

输入数据

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 a single integer representing fn modulo 1000000007(109 + 7).

样例

样例说明

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).

提交

请先 登录

© 2025 FAQs Contact About