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:
13, 13, ['3469', 'y', '7357', 'J', 'd', 'k', 't', '7651', 'o', '8367', 'H', 'V', 'q', 'O', '3059', 'e', 'A', '5639', 'm', 's', 'w', '2529']

Ex Output:
q


Ex Input:
3, 3, ['C', 'V', '9233', '4221', 'm', 'I', 'n', 'I']

Ex Output:
9233


Ex Input:
12, 24, ['H', 'Q', '9143', '6321', '1743', '9859', '433', '6959', '7363', '8093', 'D', 'W', 'u', '9719', '8221', '6345', '8815', '1257', 'i', 'Q', '8803', '8037', '5785', '1581']

Ex Output:

1581578580378803Qi12578815634582219719uW