Why i am getting TLE

passing only one test case and rest of them are TLE. please find flaw in my code

#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
#define mp make_pair
#define pb push_back
#define set(a) memset(a,0,sizeof(a))
#define sort(a) sort(a,a+n)
#define fo(i,n) for(i=0;i<n;i++)
#define PI 3.1415926535897932384626

long long int tilling(long long int n,long long int m)
{
if(n<=3)
return 1;

long long int ans=0;

ans=ans+tilling(n-1,m)+tilling(n-m,m);
return ans;

}

int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);

int t;
cin>>t;
while(t--)
{
    long long int n,m;
    cin>>n>>m;

    long long int ans=tilling(n,m)%1000000007;

    cout<<ans<<endl;

}
return 0;

}

@shivamgoel150 constraints are large so cant be done without dp here refer this


dont forget to hit like and mark resolved if cleared :smiley: