Easy Boxes

There are n boxes in a row from left to right. You are standing on the first box. From every step from box number i , you can jump at most k boxes further ( i+1,i+2,…,i+k). You cannot jump over box number n. How many ways are there to travel to box number n? Constraints: 1 ≥ T ≥ 50 1 ≥ n,k ≥ 103 Input format: The first line contains integer 'T', denoting the number of testcases. The followin