## FIBOSUM - Fibonacci Sum

no tags

The fibonacci sequence is defined by the following relation:

• F(0) = 0
• F(1) = 1
• F(N) = F(N - 1) + F(N - 2), N >= 2

Your task is very simple. Given two non-negative integers N and M, you have to calculate the sum (F(N) + F(N + 1) + ... + F(M)) mod 1000000007.

### Input

The first line contains an integer T (the number of test cases). Then, T lines follow. Each test case consists of a single line with two non-negative integers N and M.

### Output

For each test case you have to output a single line containing the answer for the task.

### Example

```Input:
3
0 3
3 5
10 19

Output:
4
10
10857```

### Constraints

• T <= 1000
• 0 <= N <= M <= 109 hazard_10: 2018-05-13 02:42:21 Last edit: 2018-05-30 17:14:07 ameyanator: 2018-03-22 22:20:06 I've learnt matrix exponentiation because of this question hrsh_sengar: 2018-03-14 19:57:24 My 101th :) m2do: 2018-01-10 19:48:53 Matrix Exponentiation it is! :) rohansaraf033: 2017-12-24 21:40:59 Learnt matrix expo: but not tried with f(n+2)-1 :) chetan4060: 2017-12-19 13:08:46 AC in one go:-) sandeep_123: 2017-12-14 21:46:06 Matrix exponentiation and f(1)+f(2)+f(3)+... + f(n) = f(n+2)-1 did this :D !! 82nd AC sirjan13: 2017-10-08 19:06:09 Matrix Expo :) babur: 2017-08-23 14:38:43 AC after 1 wa....take care of negative modulus.. swarup03: 2017-07-14 08:55:24 Ac in one go :) Didn't use Matrix Exponention, Dijkstra's formula was good enough. And yes negative mod must be taken into account. Thanks @sagnik_66 for the hint