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]: 5, 6, ['e', 'T', 'w', 'K', 'D', 'l', 'S']
[EX A]: l, D

[EX Q]: 5, 13, ['3801', '4059', '725', '4521', '3453', '6603', 'P', 'G', 'X', '1317', 'l', '629', 'r', 'P', 'I']
[EX A]: r, 629, l, 1317, X, G, P, 6603, 3453

[EX Q]: 12, 20, ['3399', 'Z', 'c', '9867', '3373', '1757', '4275', 'I', '5511', '5807', 'P', '3281', 't', 'W', '8375', '3059', 'N', 'c', '9863', 'z', 'C', 's']
[EX A]:
z, 9863, c, N, 3059, 8375, W, t, 3281