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: 4, 6, ['1501', '8899', '5959', '1311', 'B', '3583', '6825']

A: 3583, B, 1311
****
Q: 16, 21, ['3061', 'H', '4673', 'A', '9345', 'I', '5195', '4173', '4359', 'z', '7993', 'C', 'q', '6529', 'q', 'D', 'T', 'C', '3663', '9075', '8399', '4459', 'B', '9147', 'C']

A: 8399, 9075, 3663, C, T, D
****
Q: 1, 15, ['1435', 'j', '7373', '9639', '3551', '3485', '3721', 'H', 'H', '939', 'd', '3695', '6167', '867', '9135', '6525', 'F', 'q', 'x']

A:
9135, 867, 6167, 3695, d, 939, H, H, 3721, 3485, 3551, 9639, 7373, j, 1435
****