please check this code and tell mistake
copy
#include<bits/stdc++.h>
using namespace std;
long long int p=1000000000+7;
long long int ways[100001];
long long int tilling(long long int n,long long int m)
{
if(n<m)
{
ways[n]=1;
return 1;
}
if(ways[n]==-1)
{
long long int ans=(tilling(n-1,m)%p+tilling(n-m,m)%p)%p;
ways[n]=ans%p;
return ways[n]%p;
}
else
{
return ways[n]%p;
}
}
int main()
{
for(int i=0;i<100001;i++)
{
ways[i]=-1;
}
int t;
cin>>t;
long long int n,m;
for(int i=0;i<t;i++)
{
for(int i=0;i<100001;i++)
{
ways[i]=-1;
}
cin>>n;
cin>>m;
if(m==1)
{
cout<<“1”<<"\n";
}
else
{
long long int res=tilling(n,m);
cout<<res%p<<"\n";
}
}
return 0;
}