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]: 6, 8, ['d', 'E', '5523', 'O', '863', 'X', 'p', '9873', 's', '7623']
[EX A]: 9873, p, X

[EX Q]: 3, 12, ['2905', 'j', '4763', '8551', '6713', '3927', '8725', 'A', '695', '5731', 'o', '2883', '1469', '3471', 'P', 'k']
[EX A]: 2883, o, 5731, 695, A, 8725, 3927, 6713, 8551, 4763

[EX Q]: 3, 16, ['3567', 'Z', '3007', 'k', '4821', 'I', 'O', 'X', '2541', '8165', 'y', '2547', '5307', '3661', 'D', '5805', 'h', '6269', 'S', '2209', '1631', 'A']
[EX A]:
5805, D, 3661, 5307, 2547, y, 8165, 2541, X, O, I, 4821, k, 3007