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: 4, 16, ['Q', 'Y', 'm', '2899', '3855', 'b', '4503', '3635', 'G', 'S', '9523', 'n', 'e', '6307', '8509', '9013', 'A']
Example Output: 9013, 8509, 6307, e, n, 9523, S, G, 3635, 4503, b, 3855, 2899

Example Input: 12, 14, ['S', '8701', 'Z', 'J', '667', 'l', '8411', 'C', '4563', 'n', 'U', 'Q', 'y', '9381', 'S', '2771', '4963', 'I', 'M']
Example Output: 9381, y, Q

Example Input: 7, 15, ['h', 'h', 'd', 'W', '497', '295', '8741', 'j', 's', '6637', '1659', 'y', '7919', 'i', '7449', 'L', '6431', '4385']
Example Output:
7449, i, 7919, y, 1659, 6637, s, j, 8741