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, 14, ['S', '8701', 'Z', 'J', '667', 'l', '8411', 'C', '4563', 'n', 'U', 'Q', 'y', '9381', 'S', '2771', '4963', 'I', 'M']
[EX A]: 9381, y, Q

[EX Q]: 1, 2, ['31', 'Y', 'S', 'K', '251', '837']
[EX A]: Y, 31

[EX Q]: 2, 15, ['575', '2283', 'V', '9425', '5205', '2321', 'z', '5655', '4217', 'z', '1309', '1865', '3187', 'w', 'n', '4101', 'C', '8599', 'p', 'N']
[EX A]:
n, w, 3187, 1865, 1309, z, 4217, 5655, z, 2321, 5205, 9425, V, 2283