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, 7, ['2199', 'L', 'S', 'u', 'v', '4809', '8661', 'w', '2893', '3299', '8841']
[EX A]: 8661, 4809, v, u, S

[EX Q]: 2, 12, ['A', 'F', '2613', '6919', '2381', '2981', 'Z', 'S', '915', 'A', '4377', 'M', '8111', '491', 'U', '9821', 'w', 'r', 'k', '6831']
[EX A]: M, 4377, A, 915, S, Z, 2981, 2381, 6919, 2613, F

[EX Q]: 6, 10, ['q', '3713', 'u', '2237', 't', 'H', '8181', 'F', '717', '1199']
[EX A]:
1199, 717, F, 8181, H