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, 6, ['D', 'X', '6211', '6533', '7783', 'G', 'B', 'o', '9871', 'E', '6691', 'F', 'U', '8191', '6569', '8907', '2861', 'h', '4665', 'U', 'J', '1901', 'V', 'd', 'A', 'Z', '9537', '1553']

Ex Output:
G778365336211


Ex Input:
2, 3, ['D', '373', '8515', 'G', 'G', 'c']

Ex Output:
8515373


Ex Input:
1, 20, ['w', 'l', 'V', 'i', '7887', '6043', 'l', 's', 'g', '4929', 'O', 'W', 'P', 'E', 'm', '337', '1141', '1933', 'U', 's', '3061']

Ex Output:

sU19331141337mEPWO4929gsl60437887iVlw