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: 10, 15, ['4531', '657', 'x', 'a', '6601', '1889', '1029', 'B', 'a', 'N', '8659', 'D', 'G', '9249', '3307', '2409', 'd', '5857']
Example Output: 3307, 9249, G, D, 8659, N

Example Input: 1, 10, ['E', '9369', '9109', '5383', '4905', 'y', '8423', 'H', 'l', 'c', '1289', 'r', 'Y', '107', '4483', '369', 'q', 'U']
Example Output: c, l, H, 8423, y, 4905, 5383, 9109, 9369, E

Example Input: 4, 6, ['1501', '8899', '5959', '1311', 'B', '3583', '6825']
Example Output:
3583, B, 1311