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

hide comments
god_father: 2012-07-23 20:20:26

very nice question...!!!!

Mukul: 2012-06-06 11:23:33

Ufffff..........

Mathan Kumar: 2012-05-06 20:01:16

Finally, got AC!!!

Rohmad Raharjo: 2011-09-09 16:45:58

I got the sum formula but insufficient data type..
Anyone know the solution?

Nanda Bagus Pradnyana: 2011-01-13 18:04:10

happy TLE


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