You will be given a definition of a task first, then some input of the task.
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.

12, 24, ['n', '1617', 'o', 'X', '4517', '9399', 'E', 'w', 'V', '3895', '8125', 'Z', 'j', '2057', 'm', '2121', '1927', '9075', '9765', 'z', 'o', 'Z', '7139', '2013', '8185', '5109', 'm', '8761']
Output:
2013, 7139, Z, o, z, 9765, 9075, 1927, 2121, m, 2057, j, Z