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]: 7, 9, ['g', '385', '9309', 's', '9227', 'h', '9721', '9273', 'e']
[EX A]: e, 9273, 9721

[EX Q]: 6, 8, ['d', 'E', '5523', 'O', '863', 'X', 'p', '9873', 's', '7623']
[EX A]: 9873, p, X

[EX Q]: 9, 13, ['f', 'd', '8679', '6421', 'C', '3741', '7605', '1607', 'q', '2281', 'q', '4965', 'n', '117', '9973', 'Z', 'H', '3883', '9761']
[EX A]:
n, 4965, q, 2281, q