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: 8, 10, ['C', '257', '4289', 'M', '193', 'C', '9633', 'x', 'g', '6953', '2199', 'p', '2733', '2517']

A: 6953, g, x
****
Q: 1, 16, ['L', '6495', '4759', 'N', '9835', 'D', 'U', '1423', 'Y', '6959', 'j', '3557', '1635', '609', '8695', 'Q', '7927', '8759', '7537', '3135', '3369']

A: Q, 8695, 609, 1635, 3557, j, 6959, Y, 1423, U, D, 9835, N, 4759, 6495, L
****
Q: 7, 12, ['4663', 'i', '6477', '9505', 'S', '7891', 'F', 'd', 'L', '2501', '3749', '809', '4847']

A:
809, 3749, 2501, L, d, F
****