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: 15, 18, ['2157', 'P', 'n', '5155', 'L', 'P', 's', '5401', 'c', 'T', 'h', '3801', 'S', 'c', 'V', 'P', 'l', 'G', 'j', '839', '6383', 'C']
Example Output: GlPV

Example Input: 6, 13, ['7805', '3575', 'k', '8497', 'C', 'p', 'x', 'v', 'g', '1919', '397', '2757', '6027', 'u', '507']
Example Output: 602727573971919gvxp

Example Input: 2, 5, ['H', '7715', '5953', 'U', 'o']
Example Output:
oU59537715