Mod_circular_array_rotation.java

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
        Scanner s = new Scanner(System.in);
        int n = s.nextInt();
        int k = s.nextInt();
        int q = s.nextInt();
        int arr[] = new int[n];
        int dup[] = new int[n];
        int arr_q[] = new int[q];
        for(int n_i=0; n_i<n; n_i++){
            arr[n_i] = s.nextInt();
            dup[n_i] = arr[n_i];
        }
        k = k%n;
        int temp;
        for(int i=0;i<n;i++){
        temp = (i+n-k)%n;
        arr[i]=dup[temp];   
        }
        
        for(int q_i=0; q_i<q; q_i++){
            arr_q[q_i] = s.nextInt();
            if(arr_q[q_i] < n)
            System.out.print(arr[arr_q[q_i]] + "\n");
        }
        
    }
}