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: 20, 25, ['915', '3233', 'F', 'Y', 'V', 'd', 'Q', '341', '3255', 'T', 'Y', '667', '7445', 'X', 'x', 'k', 'w', 'p', '1213', '4059', 'O', '4977', 'a', '2993', 'I']

A: I, 2993, a, 4977, O, 4059
****
Q: 6, 12, ['k', '4809', 'A', '3939', 'C', '6075', '1533', '5743', 'D', 'U', '1249', '4295', '5617', '9615', 'z', '973', 'w', 'N']

A: 4295, 1249, U, D, 5743, 1533, 6075
****
Q: 1, 6, ['8995', '7375', '6865', 'b', '6563', '2291']

A:
2291, 6563, b, 6865, 7375, 8995
****