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, ['D', 'l', 'g', '151', 'S']

A: l
****
Q: 16, 18, ['4967', 'k', 'V', '3051', '1997', 'N', 'n', '1137', 'V', '6643', '8123', 'M', 'R', '7861', '7829', 'n', '6291', 'G', '5695', '5657', '2665', 'd']

A: G, 6291, n
****
Q: 7, 25, ['8395', 'g', 'z', 'Q', 'i', '1681', '2007', '5515', 'J', '5149', 'E', 'U', '8417', '7089', 's', 'o', 'Z', '8821', 'v', '7505', '4815', '3463', 'V', '1119', 't', '6475', 'L', '2637', 'I', 'M']

A:
t, 1119, V, 3463, 4815, 7505, v, 8821, Z, o, s, 7089, 8417, U, E, 5149, J, 5515, 2007
****