Given a linked list, delete N nodes after skipping M nodes of a linked list until the last of the linked list.
First line of input contains number of testcases T. For each testcase, first line of input contains number of elements in the linked list and next M and N respectively space separated. The last line contains the elements of the linked list.
Function should not print any output to stdin/console.
The task is to complete the function linkdelete() which should modify the linked list as required.