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: 6, 10, ['W', '4485', 'x', '4885', '779', '5681', '5085', '3523', '2869', '3817', 'D', 'J', '5781', '4703', '8409', '7397', '1743', 'n', 'O', 'O', 'I', '2341', 'd']
Example Output: 38172869352350855681

Example Input: 10, 10, ['f', '6369', 'B', 'p', 'T', '1169', '7861', 'I', 'G', '5077']
Example Output: 5077

Example Input: 4, 7, ['521', '9745', '645', 'O', 'd', 'X', 'e', '9159', '1095', 'p', '275', '1651', 'E', '709', '4959', 'K', '1783']
Example Output:
eXdO