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, 9, ['i', 'f', 'I', 'T', '4439', '9553', '4341', 'J', 'G', '9615', '4067', 'j', '9801', 'L', '8459', 'P', '2943', 'E', 'h', '9999', '8893', '5813', '673']
[EX A]: G, J, 4341, 9553

[EX Q]: 6, 7, ['S', '4201', 'H', 'K', 'L', '8827', 'o', '9979', 'r', '9743', 'T']
[EX A]: o, 8827

[EX Q]: 1, 7, ['6487', '1395', 'i', '9635', '2799', 'Q', '9271', '4121', '7401', '985', 'c']
[EX A]:
9271, Q, 2799, 9635, i, 1395, 6487