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.

Example Input: 6, 19, ['M', 'q', 'S', 'C', 'i', 'y', 'L', 'u', '1489', 'e', 'w', 'f', 'G', 'K', '637', '53', 'T', '9359', 'M', 'k', '7709', 'w', '6589', 'X', '9107', 'A', 'V', '6035']
Example Output: M, 9359, T, 53, 637, K, G, f, w, e, 1489, u, L, y

Example Input: 8, 9, ['u', '7037', 'T', '5543', 'f', 'm', '7501', '6709', '5183', 'b', '9', '6499', 'x']
Example Output: 5183, 6709

Example Input: 8, 10, ['1003', '5775', '9983', 'z', '2323', 'b', 'B', '5149', '6805', 'O', 'M']
Example Output:
O, 6805, 5149