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, 12, ['Q', 'i', '7971', 'e', 'p', 'z', '5181', 'g', '905', 'G', '733', '321', 'z', '9625', '6641', '6247', '5241', '6799', 'Q', 'y', '6979']

A: 321, 733, G, 905, g, 5181, z, p, e, 7971, i, Q
****
Q: 6, 8, ['z', 'G', '8577', '7481', '4439', '6615', '9421', '4005', '1607', 'M', 'A', 'i', '3299', '1585', 'j', '7189', 'd', 'T', '5383', '4325']

A: 4005, 9421, 6615
****
Q: 2, 9, ['Z', 'M', '1627', 'O', '9449', 'J', 'c', '9073', '9587', 'd', 'v', 'r', '4861', 'C', '7495', 'S']

A:
9587, 9073, c, J, 9449, O, 1627, M
****