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: 10, 12, ['233', '5565', '3017', 'r', 'N', '5143', 'm', '349', 'x', '653', 'j', 'K']
Example Output: Kj653

Example Input: 5, 6, ['g', 'H', '9957', 'C', '599', '4297', 'E']
Example Output: 4297599

Example Input: 3, 15, ['5967', 'M', 'g', '4803', 'K', '3599', 'b', '1607', '5685', 'k', 'B', '9081', 'C', '7807', '3097', '6163', 's', '1183', '8437']
Example Output:
30977807C9081Bk56851607b3599K4803g