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: 8, 13, ['s', '8529', 'p', 'm', '7059', 'j', 'C', '2863', '1513', '7099', 't', 'f', 'D', '6475']
Example Output: Dft709915132863

Example Input: 12, 17, ['T', 'o', 'e', '5003', 'r', '1309', '6761', 'h', '7471', '7863', '8521', 'L', '8941', '4289', '5099', '9433', 'U', '387', '5857', '9301', '5107', 'J', '1949', '7591', '4167', '1385', '4517', 'A']
Example Output: U9433509942898941L

Example Input: 1, 2, ['2287', '4729', 'R', '7223', 'M', '5395', 'Q', 'l', 'D', 'w']
Example Output:
47292287