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 Q]: 11, 12, ['4937', 'd', '3503', 'G', '4955', 'W', '1039', 'G', 'o', '5571', '6755', '9215', 'R', '8897', 'M', '4335', 'B', '3991', '9037', 'm', '2171', '9675', '6963']
[EX A]: 92156755

[EX Q]: 2, 3, ['4733', '2731', '1023']
[EX A]: 10232731

[EX Q]: 2, 11, ['5785', 'B', 'H', 'c', '8149', 'T', '1137', '2955', '1153', 'h', 'h', 's', 'z', '3787']
[EX A]:
hh115329551137T8149cHB