 Given a matrix A of size Nx3 representing operations. Your task is to design the linked list based on these operations.

There are four types of operations:

0 x -1: Add a node of value x before the first element of the linked list.
After the insertion, the new node will be the first node of the linked list.

1 x -1: Append a node of value x to the last element of the linked list.

2 x index: Add a node of value x before the indexth node in the linked list.
If index equals to the length of linked list, the node will be appended to the end of linked list.
If index is greater than the length, the node will not be inserted.

3 index -1: Delete the indexth node in the linked list, if the index is valid.

A[i] represents the type of operation.

A[i], A[i] represents the corresponding elements with respect to type of operation.

Note: Indexing is 0 based.

Input Format

``````The only argument given is matrix A.
``````

Output Format

``````Return the pointer to the starting of the linked list.
``````

Constraints

``````1 <= Number of operations <= 1000
1 <= All node values <= 10^9
``````

For Example

``````Input 1:
A = [   [0, 1, -1]
[1, 2, -1]
[2, 3, 1]   ]
Output 1:
1->3->2->NULL

Input 2:
A = [   [0, 1, -1]
[1, 2, -1]
[2, 3, 1]
[0, 4, -1]
[3, 1, -1]
[3, 2, -1]
]
Output 2:
4->3->NULL
``````
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details. Hints
• Hints are not available for this problem