Decorator in two-pameters fibonacci

order = lambda m : lambda func : lambda n : func(m,n)

@order(2)
def fibo(m,n): # here fibo receives two values, m = amount of numbers to be summed, n = position in sequence
    if n < m:
        return 0
    elif n == m:
        return 1
    else:
        # but below fibo receives one value
        return sum(fibo(n-k) for k in range(1,m+1)) #fibo(n-1)+fibo(n-2)

for n in range(1,20):
    print(fibo(n))

0
1
1
2
3
5
8
13
21
34
55
89
144
233
377
610
987
1597
2584