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, 6, ['y', 'Q', 's', '1195', 't', '6513', '3909', 'm', '4519', 'm', 'R', 'S', 'K', '9305', 'E', 'Z', '1691', 'c', 'G', '3775', '4921', '6261', 'C', 'F']

A: 6513, t, 1195, s, Q, y
****
Q: 6, 12, ['E', 'U', '5441', 'w', 'J', '7305', '3875', '2693', 'J', '7631', 'd', '7369']

A: 7369, d, 7631, J, 2693, 3875, 7305
****
Q: 5, 7, ['h', 'K', '4629', 'e', '9177', '5443', 'i', '2277']

A:
i, 5443, 9177
****