Problem: <image>

To monitor cryptocurrency exchange rates trader William invented a wonderful device consisting of n lights arranged in a row. The device functions in the following way:

Initially, all lights on William's device are turned off. At the beginning of a new iteration the device randomly, with a uniform distribution, picks a light that is turned off and turns it on, telling William which cryptocurrency he should invest in. After this iteration if any k consecutive lights contain more than one turned on light, then the device finishes working.

William doesn't like uncertainty, so he wants you to calculate the expected value of the number of lights that are turned on in the device after it finishes working.

Input

Each test contains multiple test cases. The first line contains the number of test cases t (1 ≤ t ≤ 10). Description of the test cases follows.

The only line for each test case contains two integers n and k (2 ≤ k ≤ n ≤ 10^5), which are the total number of lights and the length of subsegment of lights that are being checked, respectively.

Output

For each test case print the answer, modulo 10^9+7. 

Formally, let M = 10^9+7. It can be shown that the answer can be expressed as an irreducible fraction p/q, where p and q are integers and q not ≡ 0 \pmod{M}. Output the integer equal to p ⋅ q^{-1} mod M. In other words, output such an integer x that 0 ≤ x < M and x ⋅ q ≡ p \pmod{M}.

Example

Input


3
3 2
15 2
40 15


Output


333333338
141946947
329622137

Note

Explanation of the first sample test case:

Let's write out all possible sequences of light toggles, which will make the device complete its operation:

  1. (1, 2) — 2 lights are turned on 
  2. (1, 3, 2) — 3 lights are turned on 
  3. (2, 1) — 2 lights are turned on 
  4. (2, 3) — 2 lights are turned on 
  5. (3, 2) — 2 lights are turned on 
  6. (3, 1, 2) — 3 lights are turned on 



Then the final expected value will be equal to 2/6 + 3/6 + 2/6 + 2/6 + 2/6 + 3/6 = 14/6 = 7/3. 

Then the required output will be 333333338, since 333333338 ⋅ 3 ≡ 7 \pmod{10^9+7}.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
#define mii map<int,int>
#define vi vector<int>
#define vii vector<pair<int,int> >
#define int long long
#define ii pair<int,int>
#define loop(i,a,b) for(int i=(a);i<(b);i++)
#define rloop(i,a,b) for(int i=(a);i>(b);i--)
#define tr(it,c) for(decltype((c).begin()) it=(c).begin();it!=(c).end();it++)
#define all(c) (c).begin(),(c).end()
#define mp make_pair
#define pb push_back
#define ft first
#define sd second
#define mod 998244353ll
#define mod2 1000000007ll
#define mem(a,b) memset(a,b,sizeof(a))
#define SYNC ios_base::sync_with_stdio(false);cin.tie(NULL)
#define PI 3.1415926535
#define double long double
 
using namespace std;



/********************************************************************************************************************************/


int mpow(int x,int y,int m)
{
	int res=1;
	while(y>0)
	{
		if(y&1)
		res=res*x%m;
		y=y>>1;
		x=x*x%m;
	}
	return res;
}

int inv(int x,int m)
{
	return mpow(x,m-2,m);
}

const int M=1e5+1;
int fact[M],invfc[M],ways[M];

void solve()
{
	int n,k;
	cin>>n>>k;
	
	fact[0]=1,invfc[0]=1;
	loop(i,1,n+1)
	{
		fact[i]=fact[i-1]*i%mod2;
		invfc[i]=inv(fact[i],mod2);
	}
	
	int ans=0;
	loop(i,2,n+1)
	{
		int tot=fact[n]*invfc[n-i]%mod2;
		ways[i]=tot;
		int x=n-(k-1)*(i-1);
		if(x>=i)
		ways[i]-=fact[x]*invfc[x-i]%mod2;
		ways[i]=(ways[i]+mod2)%mod2;
		
		int num=ways[i]-ways[i-1]*(n-i+1)%mod2;
		num=(num+mod2)%mod2;
		ans+=num*inv(tot,mod2)%mod2*i%mod2;
	}
	cout<<ans%mod2;
}

signed main()
{
	

	SYNC;
	//freopen("input.txt","r",stdin);
	//freopen("output.txt","w",stdout);
	
	
	int t=1;	
	cin>>t;
	loop(i,1,t+1)
	{	
		//cout<<"Case #"<<i<<": ";
		solve();
		cout<<"\n";
	}
}