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: 2, 3, ['W', 'Y', '6265', 'D']
Example Output: 6265Y

Example Input: 6, 7, ['D', '1819', '9379', 'B', '6071', 'Q', 'T', 'V', '4239', '3199', 'h', 'O', '5369', '3553', 'd', 'l', 'J', '6959', '8007', 'j']
Example Output: TQ

Example Input: 2, 9, ['H', '727', '9037', '49', 'h', 'o', 'i', 'N', 'q', 'K', 'e', '6095', '851', 'a', 'g', '5537']
Example Output:
qNioh499037727