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, 12, ['Q', 'i', '7971', 'e', 'p', 'z', '5181', 'g', '905', 'G', '733', '321', 'z', '9625', '6641', '6247', '5241', '6799', 'Q', 'y', '6979']
Example Output: 321, 733, G, 905, g, 5181, z, p, e, 7971, i, Q

Example Input: 1, 2, ['e', '7891']
Example Output: 7891, e

Example Input: 6, 12, ['b', 'l', 'r', '6641', 'r', '5747', 'j', 'E', 'p', 'n', 'R', 'M', '4007', 'r']
Example Output:
M, R, n, p, E, j, 5747