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]: 4, 6, ['w', '7135', 'l', 'e', 'V', '5989', '5537', 'Q', 'T', '1017', 'D', '5645']
[EX A]: 5989, V, e

[EX Q]: 4, 8, ['y', 'q', '5187', '4995', 'I', '9121', 'h', 'X', 'O', '2503', 'l', '2029', 's', 'U', 'G', 'Q', '6171', 't']
[EX A]:
X, h, 9121, I, 4995