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: 13, 20, ['q', 't', 'r', '4927', 'K', '8361', '8057', 'j', '6415', '7971', 'n', '4535', 'o', 'k', '9361', '1671', '6953', 'D', 'i', 'C', 'm', '9783', 'y', '3179', '903', 'P', 'V', '4701', 'z', '2819']
Example Output: CiD695316719361ko

Example Input: 2, 14, ['2073', 'j', 'd', 'K', '3297', 'l', 'H', 'T', '2723', 'R', 'h', '741', '6445', '5897', 'R', 'F', '6935', '9085']
Example Output:
58976445741hR2723THl3297Kdj