# your code goes here
def recursion_zenik(n,k,path=[]):
	if path and max(path)-min(path)>k:
		print('Zenik rule fail:',path)
		return 0
	if n==0:
		print('Success:',path)
		return 1
	return sum(recursion_zenik(n-i,k,path+[i]) for i in range(1,n+1))

print('Result =',recursion_zenik(5,2))