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]: 10, 19, ['3335', '9551', 'l', 'Z', '5265', 'u', '2299', 'v', '7613', '433', '2435', '1233', 'S', '9785', '7019', '775', 'n', '3267', '6755', 'r', 'N', 'b', '4063', 'p', 'W', '2491']
[A]: 6755, 3267, n, 775, 7019, 9785, S, 1233, 2435, 433


[Q]: 1, 8, ['5853', 'w', 'O', 'x', '9803', 'A', 'M', '395']
[A]:
395, M, A, 9803, x, O, w, 5853