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:
22, 22, ['D', 'U', 'O', '2609', '7785', 'F', 'v', 'g', '5451', 'W', 'D', 'n', 'R', '1483', 'o', 't', '6741', 's', 'u', '9611', 'Y', '1261', '8023']

Ex Output:
1261


Ex Input:
1, 8, ['g', '6673', '761', 'B', '9393', '5409', 'A', '245', '4053']

Ex Output:
245A54099393B7616673g


Ex Input:
1, 6, ['5825', '6263', '6905', 'B', 'M', '6785', 'S', '8317', '7121']

Ex Output:

6785MB690562635825