1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4 #define maxn 100005 5 using namespace std; 6 const int mod=1000000007; 7  8 int dp[maxn]; 9 10 void inti()//一个数的划分11 {12     dp[0]=1;13     for(int i=1; i<=100000; i++)14     {15         dp[i]=0;16         for(int j=1; ; j++)17         {18             int x=(3*j-1)*j/2;19             if(x>i) break;20             int s=dp[i-x];21             if(x+j<=i) s=(s+dp[i-j-x])%mod;22             if(j&1) dp[i]=(dp[i]+s)%mod;23             else dp[i]=(dp[i]-s+mod)%mod;24         }25     }26 }27 28 int main()29 {30     inti();31     int t;32     scanf("%d",&t);33     while(t--)34     {35         int n,k;36         scanf("%d%d",&n,&k);37         int ans=dp[n];38         for(int i=1; ; i++)39         {40             int x=k*i*(3*i-1)/2;41             if(x>n) break;42             int c=dp[n-x];43             if(x+i*k<=n) c=(c+dp[n-x-k*i])%mod;44             if(i&1) ans=(ans-c+mod)%mod;45             else ans=(ans+c)%mod;46         }47         printf("%d\n",ans);48     }49     return 0;50 }