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:
15, 16, ['243', '3195', '1763', '1283', '1463', '2655', '7', 'S', 's', '3155', 's', 'D', '7659', 'Q', 'm', '3821', '593', 'D', '5447']

Ex Output:
3821m


Ex Input:
13, 20, ['q', 't', 'r', '4927', 'K', '8361', '8057', 'j', '6415', '7971', 'n', '4535', 'o', 'k', '9361', '1671', '6953', 'D', 'i', 'C', 'm', '9783', 'y', '3179', '903', 'P', 'V', '4701', 'z', '2819']

Ex Output:
CiD695316719361ko


Ex Input:
1, 15, ['H', '5035', '7713', 'D', 'E', 'a', 'k', 'l', '2009', '1989', 'J', '5809', '6647', '5043', '6665']

Ex Output:

6665504366475809J19892009lkaED77135035H