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]: 2, 2, ['D', 'l', 'g', '151', 'S']
[EX A]: l

[EX Q]: 3, 7, ['u', '7399', '7417', '281', '925', 'x', '2047', '1767', '1777', '9847', 'F', '9805', 'w', 'q', '8639', 'N', '4355', 'z', 'q', 'I', 'o', 'n', '9773', '7465', 'K', 'J', 'X', '6881']
[EX A]: 2047, x, 925, 281, 7417

[EX Q]: 3, 8, ['l', '3245', 'b', 'q', '5417', 'n', '29', 'x']
[EX A]:
x, 29, n, 5417, q, b