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
rakcode1998:
20170611 14:07:35
Why will it ever be negative? @sagnik_66


sagnik_66:
20170609 18:23:45
Take care about the negative answers. Just add 1000000007.


anurag_333:
20170530 13:19:40
@vineetpratik can you show me your dijkshra code??


thakur13:
20170505 11:34:57
Jbardast Problem 

anurag_tangri:
20170405 16:02:14
2 TLE 2 WA and finally AC:) 

rv404674:
20170327 15:51:21
ac in 0.00 using fast matrix exponentiation 

vineetpratik:
20170314 07:43:06
Dijkstra's fibonacci formula 0.09sec 92M


vineetpratik:
20170310 17:35:55
Dijkstra's fibonacci formula 

nilabja16180:
20170304 09:09:01
Use long long, costed me one WA! 

priyasatbhaya:
20160909 02:42:29
@baadshah_ thanks for the negative modulus solution 
Added by:  David Gómez 
Date:  20101204 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  My Own 