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]: 1, 3, ['u', '5915', 'm', 'C', 'f', 'W', '6229', '7963', '8063', '1397']
[A]: m, 5915, u


[Q]: 11, 22, ['s', '1543', 'n', 'n', 'Z', '4421', 'Q', '6695', 'Y', '7495', 'm', '7293', 'l', 'd', '955', '7703', '6595', 'G', 'g', '9375', '9257', '1111', '1179', '1523', '505']
[A]:
1111, 9257, 9375, g, G, 6595, 7703, 955, d, l, 7293, m