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]: 2, 2, ['M', '7489', '6685']
[EX A]: 7489

[EX Q]: 1, 3, ['m', 'W', '7525', '9021']
[EX A]: 7525, W, m

[EX Q]: 20, 25, ['915', '3233', 'F', 'Y', 'V', 'd', 'Q', '341', '3255', 'T', 'Y', '667', '7445', 'X', 'x', 'k', 'w', 'p', '1213', '4059', 'O', '4977', 'a', '2993', 'I']
[EX A]:
I, 2993, a, 4977, O, 4059