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.

Input: Consider Input: 7, 12, ['2947', 'x', 'x', 'N', 'w', '2527', '4807', '343', 'r', 'i', '9369', 'J']

Output: J, 9369, i, r, 343, 4807


Input: Consider Input: 2, 5, ['3201', 'l', 'o', 'W', 'U']

Output: U, W, o, l


Input: Consider Input: 10, 20, ['p', 'b', 'X', 'l', '3725', 'O', '9393', '6645', '5363', '4873', 'U', '5129', 'Q', 'b', '2435', 'D', '7503', 'M', '9785', 'I']


Output: I, 9785, M, 7503, D, 2435, b, Q, 5129, U, 4873