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: 3, 7, ['2199', 'L', 'S', 'u', 'v', '4809', '8661', 'w', '2893', '3299', '8841']

A: 8661, 4809, v, u, S
****
Q: 7, 15, ['H', 'F', 'F', 'V', 'K', 'q', 'l', '195', '3065', 'O', '9121', '8583', '5221', '239', '7321', 'j', '2513', '835', '951', '1119', '2045', '5479', 'u', 'p', 'o', 'z']

A: 7321, 239, 5221, 8583, 9121, O, 3065, 195, l
****
Q: 1, 11, ['m', 'a', '3915', 'r', 'Y', 'n', '1565', '8655', 'D', '8449', 'k', '4817', '5097', 'R']

A:
k, 8449, D, 8655, 1565, n, Y, r, 3915, a, m
****