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: 19, 20, ['x', '6239', 'D', 'l', 'Y', 'd', '6405', 'l', '2629', '4743', '8271', '3749', 'W', 'r', '9153', '2941', '6477', '2623', 'F', 'J']
Example Output: JF

Example Input: 1, 3, ['8975', '5175', 'X']
Example Output: X51758975

Example Input: 9, 16, ['8825', 'A', '4371', '347', '1725', 'j', '9361', '3839', 'b', 't', '2861', 't', '9029', '311', 'w', '905']
Example Output:
905w3119029t2861tb