In this task, you are given inputs i, j, and A, where i and j are integers and A is a list. You need to find all elements of A from the ith element to the jth element, reverse the order in which they occur, and then concatenate them to output the resultant string. i and j will be non-negative, and will always have a value less than the length of A. i will always be less than j. Perform the operations in order, i.e., do not concatenate the elements and then reverse the string.

Example Input: 5, 7, ['l', '3735', 't', 'D', 'M', 'G', 'p', '7645', 'u']
Example Output: pGM

Example Input: 15, 22, ['8047', 'O', 'I', '389', '8377', 'a', 'Y', 'p', 'o', 'M', '3695', 'T', '9965', '3511', 'l', '8523', 'h', 'r', '6215', '7405', 'k', 'X']
Example Output: Xk74056215rh8523l

Example Input: 2, 16, ['H', 'K', 'q', 'w', 'v', 't', 'w', '9439', '8899', 'y', '1747', 'j', 'O', '25', '9379', 'B', '1521', 'u', '2303']
Example Output:
B937925Oj1747y88999439wtvwqK