FIBOSUM  Fibonacci Sum
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 nonnegative 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 nonnegative 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 <= 10^{9}
hide comments
hazard_10:
20180513 02:42:21
It works but I did not get the case where it will be negative ? Last edit: 20180513 02:58:24 

ameyanator:
20180322 22:20:06
I've learnt matrix exponentiation because of this question 

hrsh_sengar:
20180314 19:57:24
My 101th :)


m2do:
20180110 19:48:53
Matrix Exponentiation it is! :) 

rohansaraf033:
20171224 21:40:59
Learnt matrix expo:


chetan4060:
20171219 13:08:46
AC in one go:) 

sandeep_123:
20171214 21:46:06
Matrix exponentiation and f(1)+f(2)+f(3)+... + f(n) = f(n+2)1 did this :D !!


sirjan13:
20171008 19:06:09
Matrix Expo :) 

babur:
20170823 14:38:43
AC after 1 wa....take care of negative modulus..


swarup03:
20170714 08:55:24
Ac in one go :)

Added by:  David Gómez 
Date:  20101204 
Time limit:  0.838s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  My Own 