Flowers

题目：
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).

Examples
Input
3 2
1 3
2 3
4 4
Output
6
5
5
Note
For K = 2 and length 1 Marmot can eat ®.
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).
题目大意：刚加上其实没看懂，还是看的别人的题解才搞明白的，看来理解能力还是太差的
该题目大概讲的是有红花和白色的花组成的字符，也就是r w ，其中白色的话要连续k存在，算从a1到a2的一共有几个组成的情况。就分为第i个是白色的还是红色花，选择红色的时候dp[i]=dp[i-1]，为白色的时候dp[i]=dp[i-1]+dp[i-k]
那么代码就很简单了主要是理解

#include<cstdio>
#include <cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;

int main()
{
	int t,k,i;
	int c,b;
	long long int a[100001];a[0]=0;
	long long int m=1000000007;
	cin>>t>>k;
	for(i=1;i<=100000;i++)
	{
		if(i<k)
		{
			a[i]=1;
		}
		else if(i==k)
		{
			a[i]=2;
		}
		else
		{
			a[i]=(a[i-1]+a[i-k])%m;
		}
	}
	for(i=2;i<=100000;i++)
	{
		a[i]=(a[i-1]+a[i]);
	}
	while(t--)
	{
		cin>>c>>b;
		cout<<(a[b]-a[c-1])%m<<endl;
	}
	return 0;
}