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.

Example Input: 1, 3, ['t', 'm', 'D']
Example Output: D, m, t

Example Input: 4, 16, ['Q', 'Y', 'm', '2899', '3855', 'b', '4503', '3635', 'G', 'S', '9523', 'n', 'e', '6307', '8509', '9013', 'A']
Example Output: 9013, 8509, 6307, e, n, 9523, S, G, 3635, 4503, b, 3855, 2899

Example Input: 1, 6, ['7855', '5003', '6547', '1053', '3451', '5097', 'a', '3681', 'T', '3253', 'F', '1403', '7935']
Example Output:
5097, 3451, 1053, 6547, 5003, 7855