#include<bits/stdc++.h>
#define ll long long
#define Mod 1000000007
using namespace std;
ll countWaysUtil(ll n, ll m)
{
int res[n];
res[0] = 1; res[1] = 1;
for (int i=2; i<=n; i++)
{
res[i] = 0;
for (int j=1; j<=m && j<=i; j++)
res[i] += res[i-j] % Mod;
}
return res[n-1] % Mod;
}
ll countWays(ll s, ll m)
{
return countWaysUtil(s+1, m) % Mod;
}
int main ()
{
int t; cin >> t;
while(t--){
ll s, m;
cin >> s >> m;
cout << countWays(s,m) << endl;
}
return 0;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KI2RlZmluZSBsbCBsb25nIGxvbmcKI2RlZmluZSBNb2QgMTAwMDAwMDAwNwp1c2luZyBuYW1lc3BhY2Ugc3RkOwpsbCBjb3VudFdheXNVdGlsKGxsIG4sIGxsIG0pIAp7IAogICAgaW50IHJlc1tuXTsgCiAgICByZXNbMF0gPSAxOyByZXNbMV0gPSAxOyAKICAgIGZvciAoaW50IGk9MjsgaTw9bjsgaSsrKSAKICAgIHsgCiAgICAgICByZXNbaV0gPSAwOyAKICAgICAgIGZvciAoaW50IGo9MTsgajw9bSAmJiBqPD1pOyBqKyspIAogICAgICAgICByZXNbaV0gKz0gcmVzW2ktal0gJSBNb2Q7IAogICAgfSAKICAgIHJldHVybiByZXNbbi0xXSAlIE1vZDsgCn0gCmxsIGNvdW50V2F5cyhsbCBzLCBsbCBtKSAKeyAKICAgIHJldHVybiBjb3VudFdheXNVdGlsKHMrMSwgbSkgJSBNb2Q7Cn0gCmludCBtYWluICgpIAp7IAogICAgaW50IHQ7IGNpbiA+PiB0OwoJd2hpbGUodC0tKXsKCQlsbCBzLCBtOwoJCWNpbiA+PiBzID4+IG07CgkJY291dCA8PCBjb3VudFdheXMocyxtKSA8PCBlbmRsOwoJfSAKICAgIHJldHVybiAwOyAKfSAK