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]: 12, 17, ['J', 'A', '1069', 'g', '2511', 'k', 'K', '93', '6487', 'f', '2903', '741', 'u', 'b', 'J', 'h', '6937', '4393', '3449', 'V']
[EX A]: 6937, h, J, b, u, 741

[EX Q]: 9, 17, ['7367', 'p', '5215', 'o', '3359', '3039', 'I', 'g', 'F', '5557', '7943', 'L', 'w', '1177', '4513', 'X', '4645']
[EX A]: 4645, X, 4513, 1177, w, L, 7943, 5557, F

[EX Q]: 1, 6, ['8489', '5987', '1435', 'H', '1369', '6497']
[EX A]:
6497, 1369, H, 1435, 5987, 8489