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 list all elements of A from the ith element to the jth element in the reverse order. 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.

[EX Q]: 7, 7, ['5803', '7305', 'v', 'n', '7813', 'c', 'n', '1161', 'd', 'r', '4781', 'c', 'X', 'X', 'E', 'D', 'Q', 'n', '4067', '5411', 'B', 'a', 'U']
[EX A]: n

[EX Q]: 3, 4, ['G', 'c', 'o', '9523', 'o', '699', '9557', 'I']
[EX A]: 9523, o

[EX Q]: 1, 14, ['4697', '8771', 'o', 'X', '9485', 'g', 't', 'H', '5517', 'G', 'g', '5069', 'H', '9679', '1331']
[EX A]:
9679, H, 5069, g, G, 5517, H, t, g, 9485, X, o, 8771, 4697