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: 1, 3, ['u', '5915', 'm', 'C', 'f', 'W', '6229', '7963', '8063', '1397']
Example Output: m, 5915, u

Example Input: 4, 16, ['F', 'g', 'V', '8477', '1505', 'u', '2653', 'E', '6447', 'W', 'F', '749', 'e', '3205', 'j', 'W', '9457']
Example Output: W, j, 3205, e, 749, F, W, 6447, E, 2653, u, 1505, 8477

Example Input: 12, 24, ['Q', 'f', '7041', '6171', '5937', 'Z', 'I', 'D', 'C', 'z', '5207', '7905', '6191', 'v', 'u', '4835', 'q', 's', '3203', 'U', '2747', 'G', '9909', '9697', 'D', 'P', 'T', 'A', 'U']
Example Output:
9697, 9909, G, 2747, U, 3203, s, q, 4835, u, v, 6191, 7905