Given a linked list with n nodes. Find the kth element from last without computing the length of the linked list.
Input Format
First line contains space separated integers representing the node values of the linked list. The list ends when the input comes as ‘-1’. The next line contains a single integer k.