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, ['9333', '4709', 'w', '4565', 'r', '8133', 'd', 'f', 'e', '787', '5633', 'P', 'j']
Example Output: P5633787

Example Input: 3, 5, ['m', 'U', '3235', 'B', '2015']
Example Output: 2015B3235

Example Input: 4, 13, ['1405', '8137', '4505', '5039', '3807', '9681', '2479', '3209', '9471', 'D', 'p', 'x', 'S', '9967', '6065', 'I', '4397', 'S', 'c', 'y', 'c', '5017', '7967', '6481', '7117', '2211', 'r', 'e']
Example Output:
SxpD947132092479968138075039