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: 6, 13, ['I', 'Z', '3859', 'M', '5135', 'X', 'h', '1215', 'z', '4385', 'Q', 'H', 'f']
Example Output: fHQ4385z1215hX

Example Input: 11, 13, ['1135', '5903', '4201', 'O', '2679', 'S', '5667', 'F', 'I', '1329', 'p', 'D', '9979', '2665', '1743']
Example Output: 9979Dp

Example Input: 14, 20, ['F', 'O', '5879', 'g', 's', '2609', '5977', 'e', 'z', '9055', 'Z', 'l', 'Q', 'm', 'D', 'G', '1257', 'i', '1303', 'j', 'I']
Example Output:
j1303i1257GDm