【CODEFORCES】 D. Flowers

D. Flowers

time limit per test

1.5 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

We saw the little game Marmot made for Mole's lunch. Now it's Marmot's dinner time and, as we all know, Marmot eats flowers. At every dinner he eats some red and white flowers. Therefore a dinner can be represented as a sequence of several flowers, some of them white and some of them red.

But, for a dinner to be tasty, there is a rule: Marmot wants to eat white flowers only in groups of size k.

Now Marmot wonders in how many ways he can eat between a and b flowers. As the number of ways could be very large, print it modulo 1000000007 (109 + 7).

Input

Input contains several test cases.

The first line contains two integers t and k (1 ≤ t, k ≤ 105), where t represents the number of test cases.

The next t lines contain two integers ai and bi (1 ≤ ai ≤ bi ≤ 105), describing the i-th test.

Output

Print t lines to the standard output. The i-th line should contain the number of ways in which Marmot can eat between ai and bi flowers at dinner modulo 1000000007 (109 + 7).

Sample test(s)

input

3 2
1 3
2 3
4 4

output

6
5
5

Note

• For K = 2 and length 1 Marmot can eat (R).
• For K = 2 and length 2 Marmot can eat (RR) and (WW).
• For K = 2 and length 3 Marmot can eat (RRR), (RWW) and (WWR).

• For K = 2 and length 4 Marmot can eat, for example, (WWWW) or (RWWR), but for example he can't eat (WWWR).

题解：这一题是一道比较简单的动归，设d[i]是吃了i朵花时的总方案数，那么d[i]=d[i-1]+d[i-k]。需要注意的是d[0]=1,d[1]在k=1的时候等于2，在其他时候d[1]=1。除此以外就是用前缀和求和在取mod输出结果了。

取mod真是个技术活。

#include 
#include 
#include 

using namespace std;

int t,k,a[100005],b[100005],max1;
long long d[100005],ans,sum[100005];

int main()
{
    max1=0;
    scanf("%d%d",&t,&k);
    for (int i=0;i