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.

Q: 1, 2, ['31', 'Y', 'S', 'K', '251', '837']

A: Y, 31
****
Q: 3, 9, ['6247', '4829', '4523', '8829', 'Q', '2929', '8033', '7979', 'h', '2133', '7197', 'H', 'S', '2633', '1605', 'R', '3083', '2363', 'k', '83', 'l', 'E']

A: h, 7979, 8033, 2929, Q, 8829, 4523
****
Q: 9, 12, ['1799', '6635', '5849', '9193', 'k', 'D', 'G', '5971', 'x', 'u', '9393', '1079', '8745', '8251']

A:
1079, 9393, u, x
****