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: 2, 2, ['L', 'U', '2099']

A: U
****
Q: 6, 19, ['n', '9851', '6633', '2703', 'L', '6711', 'F', 'U', 'X', 'c', '9773', 'Q', 'D', '6907', '3551', '691', 't', 'N', '7131']

A: 7131, N, t, 691, 3551, 6907, D, Q, 9773, c, X, U, F, 6711
****
Q: 10, 16, ['u', '9529', '3065', '885', 'm', '5475', 'r', '2067', '9759', '5197', 'G', 'Q', 'T', '2731', '6267', '9849', 'j', '853', 'V', 'y', '345', 'j', 'C', '6785', '8965', 'd', '7407']

A:
9849, 6267, 2731, T, Q, G, 5197
****