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:
6, 8, ['6277', 'X', '3141', '2291', 't', '7429', '9399', '597', 'T', '8629']

Ex Output:
59793997429


Ex Input:
10, 10, ['m', '3605', 'Z', 'V', '3607', 'A', 'G', '1181', '7523', 'c']

Ex Output:
c


Ex Input:
3, 11, ['6899', 'e', '955', 'r', '4123', '3029', 'd', 'N', 'o', 'D', 'G', 'T', '9379', 'y', '1037', 'w', 'k', 'D', '3967', 'W', 'v', 'i', '309', 'x', 'H', 'i', 'c', '8915', '5401']

Ex Output:

GDoNd30294123r955