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: 12, 18, ['N', '9555', 'H', 'd', '7941', 'U', '1965', 'G', 'E', '6947', 'q', '2341', '7909', 'n', '8625', 'r', 'M', 'F']
Example Output: FMr8625n79092341

Example Input: 3, 14, ['k', '2439', '4873', 'L', '75', '359', '5947', '3925', 'r', '9259', '3053', '5819', 'G', '285', 'Y', 's', '251', 'e']
Example Output: 285G581930539259r3925594735975L4873

Example Input: 4, 9, ['2983', 'd', '6651', '6745', 's', 'p', '1487', '6423', '2079', 'q', 'z']
Example Output:
207964231487ps6745