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, ['I', 'Y', 'e', '1691', '6749', '1105', '8069', '7437', '6711', '6983', 'j']

A: Y, I
****
Q: 14, 17, ['6577', '3911', '5781', 'r', 'G', 'Q', 'O', 'q', '7389', '7805', '7613', '8155', 'H', 'H', '8093', '7877', '3791', '4893', 'c', 'g']

A: 3791, 7877, 8093, H
****
Q: 3, 8, ['w', 'C', '8987', '1297', 'k', '7383', 'l', '2953', 'n', '4999', '7759', '875', '6903', '1933', 'N']

A:
2953, l, 7383, k, 1297, 8987
****