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: 13, 13, ['3469', 'y', '7357', 'J', 'd', 'k', 't', '7651', 'o', '8367', 'H', 'V', 'q', 'O', '3059', 'e', 'A', '5639', 'm', 's', 'w', '2529']
Example Output: q

Example Input: 10, 11, ['x', 'F', '4769', 'I', '7619', 'T', '3257', '193', '5365', 'v', 'G', 'q', '6317', 'L', '6431', 'V', 'Z', 'H', 'C', 'u', '5339', '7797', '4311', '5407', 'D']
Example Output: Gv

Example Input: 14, 16, ['Z', '3223', '799', '945', 'q', '9561', 'K', '1951', 'M', '3165', '6681', 'c', '2243', '9927', '7919', '1459', '9897', '3869', '5795', 'E', 'p', '3943', '4271', '8003', 'X', 'z']
Example Output:
145979199927