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: 2, 3, ['W', 'Y', '6265', 'D']
Example Output: 6265Y

Example Input: 10, 23, ['T', 'U', 'd', 'S', 'U', 'P', '1693', 'g', '9053', '6129', 'n', 'r', 'g', '765', '5847', 'm', 'C', 'F', 'b', 'u', 'E', '3175', 'I', 'D', 'D', '7005', '5837', '6317']
Example Output: I3175EubFCm5847765grn6129

Example Input: 4, 17, ['q', '6715', '451', '8195', 'i', '9071', 'z', 'R', '5', '1511', 'j', 'r', '5707', '6951', '9165', 'c', '5117']
Example Output:
5117c916569515707rj15115Rz9071i8195