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]: 6, 9, ['k', 's', 'q', 'g', 'o', '7949', '3531', 'j', '1005', 'c', 'P', 'Y', '6885', '1985', 'A', 'P', 'm', 'u', '1685', '8895']
[EX A]: 1005, j, 3531, 7949

[EX Q]: 13, 15, ['f', '2815', '7129', 'D', '2845', 'G', 'C', 'A', '5535', '8451', 'Y', 'J', '7655', 'S', '3', '8659']
[EX A]:
3, S, 7655