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: 1, 5, ['E', '7177', '9629', 'b', '1161', '9127', 'W', '293', '3045', '8379', '1427']
Example Output: 1161b96297177E

Example Input: 1, 6, ['4937', 'x', '6497', 'l', 'n', 'V']
Example Output: Vnl6497x4937

Example Input: 12, 27, ['U', 'c', '4805', '3995', '7353', '9739', 'g', '1505', 'N', 'R', '9387', 'H', 'A', 'g', 'I', '389', 'y', '4389', '5979', '8315', '6969', 'g', '8741', 'N', '5739', 'q', 'h', 'q', 'k', 'q']
Example Output:
hq5739N8741g6969831559794389y389IgAH