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: 9, 16, ['H', 'S', 'g', '2275', '1511', '6163', 'm', 'S', 'Q', 'C', '5829', '6275', '9281', 'v', '59', '5985', 'a', '6129', '6053', 'g', 'n', 'C', 'V', '1441', '4517', 'p', 'W', 'p', 'w', '2551']
Example Output: 598559v928162755829CQ

Example Input: 3, 3, ['f', '7257', 'n', 'Z', '1091', 'M', 'S', 'A', 'W', 'g']
Example Output: n

Example Input: 8, 9, ['4529', 'z', 'R', 'J', 'q', '3451', 'n', 'h', '1135', 'Y']
Example Output:
1135h