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
sandeep_4141: 2017-06-23 10:31:35

learn something new !! Matrix exponentiation !!
care about mod !!

anurag44: 2017-06-14 22:46:36

use long long !! Cost me 3WA's

rakcode1998: 2017-06-11 14:07:35

Why will it ever be negative? @sagnik_66

Last edit: 2017-06-11 14:07:57
sagnik_66: 2017-06-09 18:23:45

Take care about the negative answers. Just add 1000000007.
Matrix Exponentiation gives answer in 0.0 secs

anurag_333: 2017-05-30 13:19:40

@vineetpratik can you show me your dijkshra code??
how did you memorized the fibonacci no. since constrains is 10e9! and we cant save this much in memory

thakur13: 2017-05-05 11:34:57

Jbardast Problem

anurag_tangri: 2017-04-05 16:02:14

2 TLE 2 WA and finally AC:)

rv404674: 2017-03-27 15:51:21

ac in 0.00 using fast matrix exponentiation

vineetpratik: 2017-03-14 07:43:06

Dijkstra's fibonacci formula- 0.09sec 92M
Fast Matrix Exponentiation - 0.01sec 16M

vineetpratik: 2017-03-10 17:35:55

Dijkstra's fibonacci formula


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