Consider a special version of the count_stairways problem, where instead of taking 1 or 2 steps, we are able to take up to and including k steps at a time.

Write a function count_k that figures out the number of paths for this scenario. Assume n and k are positive.

def count_k(n, k):

""" >>> count_k(3, 3) # 3, 2 + 1, 1 + 2, 1 + 1 + 1

4

>>> count_k(4, 4)

8

>>> count_k(10, 3)

274

>>> count_k(300, 1) # Only one step at a time

1

"""