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: 13, 27, ['a', '3445', '9397', 'R', 'X', 'p', '1091', '8561', 's', '3391', '9695', 'J', 'l', 'l', 'v', 'D', 'G', '4845', 'E', '8549', '4491', '6841', 'K', '3909', 'r', '727', '3701', 'J', '5599', '4079']
Example Output: 3701, 727, r, 3909, K, 6841, 4491, 8549, E, 4845, G, D, v, l, l

Example Input: 2, 3, ['9239', '7321', '5235']
Example Output: 5235, 7321

Example Input: 3, 15, ['o', 'O', '2787', '3401', 'L', 'X', 'm', '979', '5597', 'F', 'L', 'l', 'G', '3083', '9217', '5987', 'f', 't', '431', 'A', '3589', 'c', '4529', 'T', 'C', 'd']
Example Output:
9217, 3083, G, l, L, F, 5597, 979, m, X, L, 3401, 2787