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 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

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

hide comments
2011-01-13 18:04:10 Nanda Bagus Pradnyana
happy TLE
2011-01-03 22:08:13 Yanuardho Tigor Pakpahan
always TLE...
2010-12-15 18:03:17 numerix
Yes, classical section is okay.
2010-12-15 16:08:38 :(){ :|: & };:

Not a bad problem,could be in classical.
2010-12-12 04:10:22 David Gómez
Should I move this problem to the tutorial section? This is a specific case of the SPP problem added by XilinX
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.