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
sai krishna:
20150111 11:51:35
learnt exponentiation


Yashpal:
20141224 23:41:57
Made Accepted in 0.00 :P 

Tahsin:
20141030 08:31:59
Negative Modulus : caused me 6 WAs :( Last edit: 20141030 08:33:14 

mayank:
20141023 09:09:43
Negative Modulus :'( . 

do_do:
20140919 23:57:18
finally accepted using matrix expo. and modular arith. :) 

do_do:
20140919 22:58:32
can someone please give me more test cases 

a7b:
20140824 08:32:01
Can somebody tell me why I'm getting a wrong answer?


sobriquet:
20140703 14:22:05
After this try FIBTWIST. 

Archit Jain:
20140703 09:49:39
nice problem Last edit: 20140703 09:49:53 

excursionist:
20140613 00:10:15
nice problem....taught many things :o

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 