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]: 3, 4, ['u', 'B', '1579', 'K']
[EX A]: K, 1579

[EX Q]: 13, 23, ['9061', 'M', 'r', '1007', '5329', 'B', 'O', '5507', '27', '2211', 'S', 's', 'Q', 'b', 'M', '1801', 'P', '4681', 'Q', '9953', '2541', 'p', 'E', '6995', 'b']
[EX A]: E, p, 2541, 9953, Q, 4681, P, 1801, M, b, Q

[EX Q]: 1, 11, ['Y', 'B', '8209', 'J', 'B', '8765', '5219', '7653', 'P', '2291', 'u', 'Y']
[EX A]:
u, 2291, P, 7653, 5219, 8765, B, J, 8209, B, Y