John Watson knows of an operation called a right circular rotation on an array of integers. One rotation operation moves the last array element to the first position and shifts all remaining elements right one. To test the abilities of Sherlock , Watson provides Sherlock with an array of integers. Sherlock is to perform the rotation operation a number of times then determine the value of the element at a given position.

For each array, perform a number of right circular rotations and return the values of the elements at the given indices in array `queries`

.

### Input Format

The first line contains 3 space-separated integers n, k & q the number of elements in the integer array, the rotation count and the number of queries.

The second line contains n space-separated integers, describing elements in `arr`

.

The third line contains q space-seprated integers, describing elements in `queries`

### Output Format

Return the array containing values of the elements at the given indices in array `queries`

.

### Example 1

**Input**

3 2 2 3 4 5 1 2

**Output**

5 3

**Explanation**

arr = [3,4,5] k = 2 queries = [1,2] Here k is the number of rotations on `arr`, and `queries` holds the list of indices to report. First we perform the two rotations: [3,4,5] -> [5,3,4] -> [4,5,3] Now return the values from the zero-based indices 1 and 2 as indicated in the `queries` array. arr[1]=5 arr[2]=3

### Example 2

**Input**

3 2 3 1 2 3 0 1 2

**Output**

2 3 1

**Explanation**

arr = [1,2,3] k = 2 queries = [0,1,2] Here k is the number of rotations on `arr`, and `queries` holds the list of indices to report. First we perform the two rotations: [1,2,3] -> [3,1,2] -> [2,3,1] Now return the values from the zero-based indices 0, 1 and 2 as indicated in the `queries` array. arr[0] = 2 arr[1] = 3 arr[2] = 1

### Constraints

1 <= n <= 10^5

1 <= arr[i] <= 10^5

1 <= k <= 10^5

1 <= q <= 500

0 <= queries[i] <= n

## Solution of Array Rotation in java:–

import java.util.*; import java.lang.*; import java.io.*; public class Main { public static void main (String[] args) throws java.lang.Exception { //your code here Scanner sc=new Scanner(System.in); int n=sc.nextInt(); int k=sc.nextInt(); int q=sc.nextInt(); int[] arr=new int[n]; int []queries=new int[q]; for(int i=0;i<n;i++) { arr[i]=sc.nextInt(); } for(int i=0;i<q;i++) { queries[i]=sc.nextInt(); } int[] rotated=new int[q]; rotated=rotatedarray(arr,k,queries); for(int i=0;i<q;i++) { System.out.print(rotated[queries[i]]+"\n"); } } public static int[] rotatedarray(int []ar,int k,int[] queries) { int n=ar.length; int q=queries.length; int []brr=new int[k-1]; for(int i=0;i<k-1;i++) { brr[i]=ar[i]; } for(int i=0;i<n-1;i++) { ar[i]=ar[i+1]; } int p=0; for(int i=k;i<n;i++) { ar[i]=brr[p]; } for(int i=0;i<q;i++) { queries[i]=ar[i]; } return queries; } }

## Add a Comment