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.

[EX Q]: 3, 6, ['231', '3609', 'S', 'k', 'v', 'q', '8995', '2613', 'B', '2739', '7225', 'B', '6787', 'b', '2211']
[EX A]: q, v, k, S

[EX Q]: 8, 18, ['e', 'X', '1617', 'D', 'W', '9195', 'L', '75', 'z', 'x', 'Y', 'g', '8893', '3291', 'h', 'B', 'y', '3133', 'D', '7939', 'H', 't', '8695']
[EX A]: 3133, y, B, h, 3291, 8893, g, Y, x, z, 75

[EX Q]: 2, 4, ['w', '9737', '3665', '5011']
[EX A]:
5011, 3665, 9737