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]: 1, 2, ['U', 'G', 'N']
[EX A]: GU

[EX Q]: 10, 23, ['T', 'U', 'd', 'S', 'U', 'P', '1693', 'g', '9053', '6129', 'n', 'r', 'g', '765', '5847', 'm', 'C', 'F', 'b', 'u', 'E', '3175', 'I', 'D', 'D', '7005', '5837', '6317']
[EX A]: I3175EubFCm5847765grn6129

[EX Q]: 2, 3, ['F', 'J', '3379']
[EX A]:
3379J