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]: 4, 4, ['W', 'p', '8495', '5643']
[EX A]: 5643

[EX Q]: 3, 3, ['D', 'G', 'm']
[EX A]: m

[EX Q]: 4, 15, ['3345', '1089', '33', '3911', 'm', '7297', '8725', 'F', '1725', '6409', 'c', 'Q', '2479', '3815', 'S', '9737', 'w', 'J', 'X', 'Z', 'P', '7987', '5211', '7693']
[EX A]:
S, 3815, 2479, Q, c, 6409, 1725, F, 8725, 7297, m, 3911