Hacker Rank Solutions for Sherlock-and-Watson

John Watson performs an operation called Right Circular Rotation on an integer array a0,a1 ... an-1. Right Circular Rotation transforms the array from a0,a1 ... aN-1 to aN-1,a0,... aN-2.

He performs the operation K times and tests Sherlock's ability to identify the element at a particular position in the array. He asks Q queries. Each query consists of one integer x, for which you have to print the element ax.

Input Format

The first line consists of 3 integers N, K and Q separated by a single space.

The next line contains N space separated integers which indicates the elements of the array A.

Each of the next Q lines contain one integer per line denoting x.

Output Format 

For each query, print the value in the location in a newline.

Constraints 

1 ≤ N ≤ 105

1 ≤ A[i] ≤ 105

1 ≤ K ≤ 105

1 ≤ Q ≤ 500

0 ≤ x ≤ N-1

Sample input

3 2 3

1 2 3

0

1

2

Sample output


2

3

1

Explanation 

After one rotation array becomes, 3 1 2.

After another rotation array becomes 2 3 1.

Final array now is 2,3,1.

0th element of array is 2.

1st element of array is 3.

2nd element of array is 1.




Solution:

#include<stdio.h>

int main(){

    int n,k,q,temp,x,i;

    scanf("%d %d %d",&n,&k,&q);

    int a[n],b[n];

    for(i=0;i<n;i++){

        scanf("%d",&a[i]);

        b[i]=a[i];

    }

    k = k % n;

    

    for(i=0;i<n;i++){

        temp = (i+n-k)%n;

        a[i]=b[temp];   

    }

    for(i=0;i<q;i++){

        scanf("%d",&x);

        printf("%d\n",a[x]);

    }

    return 0;

}