SP18915 ANIL_PRO - Anils Proposal

Anil is the best coder in his class. He is in love with his classmate Gowthami. One day he proposes her. She wants him to prove that his love is actually true. So, she poses the following problem: There is an array of size **n**. Initially all the elements are zero. Now there will be two types of operations: 1\) Update the array. 2\) Query the array. In case of update, you will be given a range \[**l**,**r**\]. To the kth element in this range ( l and r inclusive), you need to **add kth fibonacci number**. In case of query, you will be given a range \[**l,r**\], for which you need to find the sum of all elements in the range(including l and r). Anil hopes you can help him in this regard.

The first line contains **n(1

For each query print one integer per line specifying the sum in the corresponding range. Since the sum can be very large, output **Answer modulo 10 $ ^{9} $ + 7**