#include<bits/stdc++.h>
#define mod 1000000007
using namespace std;
int tiling(int n, int m){
if(n==1)
return 1;
if(n<=0)
return 0;
if(n<m)
return 1;
if(n==m)
return 2;
long long int ans1 = tiling(n-1,m);
long long int ans2 = tiling(n-m,m);
return (ans1 + ans2)%mod;
}
int main(){
int t;
cin>>t;
while(t--){
int n,m;
cin>>n>>m;
cout<<tiling(n,m)<<endl;
}
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KI2RlZmluZSBtb2QgMTAwMDAwMDAwNwp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IHRpbGluZyhpbnQgbiwgaW50IG0pewoKICAgIGlmKG49PTEpCiAgICAgIHJldHVybiAxOwoKICAgIGlmKG48PTApCiAgICAgIHJldHVybiAwOwoKICAgIGlmKG48bSkKICAgICAgcmV0dXJuIDE7CgogICAgaWYobj09bSkKICAgICAgcmV0dXJuIDI7CgogICAgbG9uZyBsb25nIGludCBhbnMxID0gdGlsaW5nKG4tMSxtKTsKICAgIGxvbmcgbG9uZyBpbnQgYW5zMiA9IHRpbGluZyhuLW0sbSk7CgogICAgcmV0dXJuIChhbnMxICsgYW5zMiklbW9kOwoKfQoKCmludCBtYWluKCl7CgogICAgaW50IHQ7CiAgICBjaW4+PnQ7CiAgICB3aGlsZSh0LS0pewoKICAgICAgICBpbnQgbixtOwogICAgICAgIGNpbj4+bj4+bTsKICAgICAgICBjb3V0PDx0aWxpbmcobixtKTw8ZW5kbDsKICAgIH0KfQo=