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: 5, 6, ['g', 'H', '9957', 'C', '599', '4297', 'E']
Example Output: 4297599

Example Input: 2, 13, ['8919', '5591', 'O', '9581', 'q', '2089', 'e', '89', '7847', '7457', '6591', '9001', '8747']
Example Output: 8747900165917457784789e2089q9581O5591

Example Input: 15, 22, ['i', 'l', '2773', '6973', '5253', '9461', 'b', 'y', 'g', '5613', 'I', '5563', '9497', '5201', 'P', 'P', 'P', 'w', 'D', '8287', 'x', '5815', 'i']
Example Output:
5815x8287DwPPP