Module Expr Str Assign NameStore Str ClassDef bases NameLoad body FunctionDef arguments args NameParam NameParam defaults body Expr Str Assign TupleStore NameStore NameStore NameStore NameStore NameStore NameLoad Assign NameStore ListLoad For NameStore NameLoad body Expr Call AttributeLoad NameLoad attr SubscriptLoad NameLoad Index BinOpMod BinOpSub NameLoad NameLoad NameLoad Return Call AttributeLoad Str attr Call NameLoad NameLoad NameLoad decorator_list decorator_list If CompareEq NameLoad Str body Import alias Assign NameStore Call NameLoad Str Str Assign TupleStore NameStore NameStore NameStore Call NameLoad NameLoad Call AttributeLoad Call AttributeLoad Call AttributeLoad NameLoad attr attr attr Str Assign NameStore Call NameLoad NameLoad Call AttributeLoad Call AttributeLoad Call AttributeLoad NameLoad attr attr attr Str Assign NameStore ListLoad For NameStore Call NameLoad NameLoad body Expr Call AttributeLoad NameLoad attr Call NameLoad Call AttributeLoad Call AttributeLoad NameLoad attr attr Assign NameStore TupleLoad NameLoad NameLoad NameLoad NameLoad NameLoad Assign NameStore BinOpMod Str Call AttributeLoad Call NameLoad attr NameLoad Print NameLoad
N/A N/A 
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.
 N/A __author__ Danyang Solution N/A object N/A solve N/A N/A self cipher N/A N/A N/A 
        algorithm: circular: original_index = (i-k)%N
        :param cipher: the cipher
         N/A N/A N K Q A q cipher N/A result N/A N/A i q N/A N/A N/A N/A result append N/A A N/A N/A N/A i K N N/A N/A N/A join N/A map str result N/A N/A N/A N/A __name__ __main__ N/A N/A sys N/A f N/A open 1.in r N/A N/A N K Q N/A map int N/A N/A N/A N/A N/A N/A f readline strip split N/A A N/A map int N/A N/A N/A N/A N/A N/A f readline strip split N/A q N/A N/A i N/A xrange Q N/A N/A N/A N/A q append N/A int N/A N/A N/A N/A f readline strip N/A cipher N/A N K Q A q N/A s N/A %s
 N/A N/A N/A Solution solve cipher N/A s