Left Rotations of an Array

Given an array of size N and Q queries, each query requires left rotating the original array by a specified number of elements. Return the modified array for each query.

Input:

The first line contains an integer 'T', denoting the number of test cases. The first line of each test case contains two integers, 'N' and 'Q'. The second line contains 'N' space-separated integers representing the array elements. The third line contains 'Q' space-separated integers representing each query.

Output:

For every query of each test case, return 'N' space-separated integers representing the array after rotation for that query.

Example:

Let array = [1, 2, 3, 4, 5, 6] and queries = {2, 4, 1}. Output for each query is: [3, 4, 5, 6, 1, 2], [5, 6, 1, 2, 3, 4], [2, 3, 4, 5, 6, 1].

Constraints:

• 1 <= T <= 10
• 1 <= N <= 1000
• 1 <= Q <= 100
• 0 <= Queries[i] <= 10⁵
• -10⁵ <= Array[i] <= 10⁵

Note:

Each query should be processed on the original array.