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: 5, 7, ['g', 'a', 'H', '831', 'u', '8803', 'D', 'h', 'Z', 'S', '5265', '679', '6565', 'z', 'V', '3395', 'u', '391', '7363', 'a', 'S', 'B', '7399', 'i']
Example Output: D, 8803, u

Example Input: 14, 17, ['4809', 'M', '8827', '5779', '7249', 'b', '8855', 'u', 'C', '6789', '6951', '7489', '5035', 'V', 'm', 'w', '2569', '6315', '235', '8283', 'y']
Example Output: 2569, w, m, V

Example Input: 1, 15, ['2975', '9609', 'O', 'd', 'B', 'X', 'A', '905', '1879', 'B', 'Y', '2157', '845', '4885', '3971', '8113', 'z', '171', 'c', 'Y', '4973', '7755', '9231', '223']
Example Output:
3971, 4885, 845, 2157, Y, B, 1879, 905, A, X, B, d, O, 9609, 2975