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: 3, 4, ['D', 'k', 'Q', '3207']
Example Output: 3207Q

Example Input: 10, 20, ['G', 'Y', 'M', 'F', 'Y', '6993', '9057', '5529', '35', 'D', '6173', '1043', '5845', 'V', 'd', '7497', '9035', 'r', 'U', '5155']
Example Output: 5155Ur90357497dV584510436173D

Example Input: 8, 9, ['1019', 'q', 'B', 'm', '5801', '7711', 'g', '4825', 'k', '9431', 'F']
Example Output:
k4825

