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: 13, 20, ['q', 't', 'r', '4927', 'K', '8361', '8057', 'j', '6415', '7971', 'n', '4535', 'o', 'k', '9361', '1671', '6953', 'D', 'i', 'C', 'm', '9783', 'y', '3179', '903', 'P', 'V', '4701', 'z', '2819']
Example Output: CiD695316719361ko

Example Input: 3, 10, ['439', 'o', 'd', '4383', '6571', 'u', '2531', '5811', '9079', 'J']
Example Output: J907958112531u65714383d

Example Input: 8, 21, ['x', 'i', 'Q', 'A', '2207', '8347', '6745', '4315', '85', 'z', 'c', 'z', '535', 'X', '7267', '1461', '543', 'h', '5235', '1659', '7921', '2349', 'E', 'A']
Example Output:
792116595235h54314617267X535zcz854315