Given the head of a linked list and two integers, m and n, remove some specific nodes from the list and return the head of the modified, linked list. The list should be traversed, and nodes removed as follows:

1. Start with the head node and set it as the current node.

2. Traverse the next m nodes from the current node without deleting them.

3. Traverse the next n nodes and delete them.

4. Repeat steps 2 and 3 above until the end of the linked list is reached.

Constraints:

• $1 \leq$ Node $\leq 10^3$ ...