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.

Input: Consider Input: 12, 13, ['x', 'V', '4453', 'Q', 'r', 'p', 'M', '2321', 'Q', '9461', 'h', 'e', 'D', 'F', 'o', 'd', 'G', 'A', 'A', 's', '2777', '3963', '3363', 'C', 'X', 't']

Output: De


Input: Consider Input: 5, 10, ['j', '2883', '9743', '9417', 'C', '3167', 'k', '6035', '201', '8563']

Output: 85632016035k3167C


Input: Consider Input: 1, 7, ['7849', '9969', '6307', '4119', 'j', 'k', 'D', '7159', '5771']


Output: Dkj4119630799697849