Fibonacci Numbers

3.3

3 votes
Easy
Problem

Find summation of Fibonacci numbers from l to r mod 99991. Precisely find (fib(l) + fib(l+1) + ..... + fib(r) ) mod 99991.

Initial conditions for Fibonacci numbers is defined as follows :

fib(0) = 0 , fib(1) = 1

Input Format

Input contains a single line containing two space separated integers l and r.

Output Format

Output single integer denoting the answer.

Constraints :

0<=l<=r<=10^18

Setter : Aayush Kapadia

Sample Input
1 4
Sample Output
7
Time Limit: 1
Memory Limit: 256
Source Limit:
Explanation

fib[1] + fib[2] + fib[3] + fib[4] = 1 + 1 + 2 + 3 = 7.

Editor Image

?