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:
3, 9, ['3563', '217', 'y', 'N', '999', 'd', 'x', 'W', 'E', '695', '1837', '2221', '7513', '1613', 'Q']

Ex Output:
EWxd999Ny


Ex Input:
2, 13, ['8919', '5591', 'O', '9581', 'q', '2089', 'e', '89', '7847', '7457', '6591', '9001', '8747']

Ex Output:
8747900165917457784789e2089q9581O5591


Ex Input:
8, 12, ['8595', 'G', 'h', '2201', '1231', '9349', '4179', '8763', '1367', 'd', '3367', '6245', '4091', 'U']

Ex Output:

62453367d13678763