Show that problem is PSPACE-complete - path in directed graph
Given $k$ and $l$ you can check if there is a path between these nodes using DFS. DFS requires polynomial space and time. So,  that problem is in PSPACE.

Update: I'd be glad to take into account the downvoter's opinion and improve the answer.