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, 8, ['s', 'S', '3207', 'k', '5997', 'G', 'D', '4107', 'K', '9347', 'Q', 'L', 'a', '1571', 'I', '4435', '3479', '835', 'p']

A: 4107, D, G, 5997, k, 3207, S
****
Q: 5, 6, ['a', '607', 'W', 'F', '6213', '5751', '8359', '2241', '4301', 'V', '355', 'V', '6083', '885', '5793', 'f']

A: 5751, 6213
****
Q: 8, 11, ['4093', 'w', 'c', 'R', 'I', '695', '535', '8369', '725', 'L', '5927', '3203', 'o']

A:
5927, L, 725, 8369
****