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]: 1, 3, ['x', 'N', 'U', 'n', '4753']
[EX A]: U, N, x

[EX Q]: 6, 10, ['Q', '3805', '8965', '6141', '1819', 'w', '243', 'Y', '435', 'i', '7489', '5167', 'X', '4641', 'T', 'B', 'g', 'j', 'j', 'c', 'H', 'J', '3231', '9277']
[EX A]: i, 435, Y, 243, w

[EX Q]: 5, 11, ['y', '7071', 'J', '9125', '4841', '5681', '2293', '8181', 'X', '5207', 'k', 'M', '1335', '1131', '8169', 'k', '7459', 'e', 's', '5999', 'G']
[EX A]:
k, 5207, X, 8181, 2293, 5681, 4841