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:
5, 9, ['q', 'g', '1455', 'f', '2605', 'B', 'r', 'B', 'y', 'z', '8295', '7259', '4945', '4519', '7885']

Ex Output:
yBrB2605


Ex 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']

Ex Output:
Gv


Ex Input:
6, 8, ['w', 'D', 'd', '5111', 'T', '2341', '9641', '203', '3177']

Ex Output:

20396412341