@@ -0,0 +1,1066 @@
+import java.io.*;%0Aimport java.util.*;%0Aimport java.text.*;%0Aimport java.math.*;%0Aimport java.util.regex.*;%0A%0Apublic class Solution %7B%0A%0A    public static void main(String%5B%5D args) %7B%0A        Scanner in = new Scanner(System.in);%0A        int n = in.nextInt();%0A        int k = in.nextInt();%0A        int q = in.nextInt();%0A        int%5B%5D a = new int%5Bn%5D;%0A        for(int a_i=0; a_i %3C n; a_i++)%7B%0A            a%5Ba_i%5D = in.nextInt();%0A        %7D%0A        int%5B%5D a1 = new int%5Bn%5D;%0A        int start = k%25n;%0A        int curr = start;%0A        boolean rev= true;%0A        int t=1;%0A        for(int i=0;i%3Cn;i++)%7B%0A            if(curr%3Cn && rev)%7B%0A                a1%5Bcurr%5D = a%5Bi%5D;%0A                %0A                curr++;%0A            %7D%0A            else%7B%0A                rev = false;%0A                if(t==1)%7B%0A                    curr=0;%0A                    t=0;%0A                %7D%0A                a1%5Bcurr%5D=a%5Bi%5D;%0A                curr++;%0A            %7D%0A        %7D%0A        for(int a0 = 0; a0 %3C q; a0++)%7B%0A            int m = in.nextInt();%0A            System.out.println(a1%5Bm%5D);%0A            %0A        %7D%0A    %7D%0A%7D%0A

add CircularArrayRotation.java