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.

Ex Input:
9, 11, ['L', 'L', '9477', 'a', 'H', 'O', '2765', 'O', 'n', 'Y', '9271', '9751', '7425', 'g', '683', '1849', 'V', 'z', 'b', '1187', 'L', '7325', '3743']

Ex Output:
9271Yn


Ex Input:
3, 4, ['d', '169', 'W', 'Y']

Ex Output:
YW


Ex Input:
12, 14, ['A', 'n', '967', '4347', '9881', 'N', 'M', '2911', '9001', 'v', 'n', 'G', '3503', '7397', '6641']

Ex Output:

73973503G