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, 9, ['4949', '5903', 'o', 'B', '4919', '7465', 'w', '4661', 'E', '6861', '9491', 'D', 'K']
Example Output: E4661

Example Input: 9, 11, ['I', '713', 'V', 'Z', '3693', '1861', '817', 'I', 'H', 'b', '9967', 'O', 'M', 'u', '7767', '853', '5445']
Example Output: 9967bH

Example Input: 5, 11, ['P', 'm', '145', '7391', 's', 'w', '9', '2895', '2951', '7129', '9029', 'B', 'M', 'p', '5157', '519', '9537', '1073', 'n']
Example Output:
90297129295128959ws