given n and k. there are total 10 groups and each group can have at most k value. So we have to find the number of ways that sum upto n . but each group has upper limit K.

here constraints are 1<=n,k<=1e9; n<=10*k