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: 6, 19, ['M', 'q', 'S', 'C', 'i', 'y', 'L', 'u', '1489', 'e', 'w', 'f', 'G', 'K', '637', '53', 'T', '9359', 'M', 'k', '7709', 'w', '6589', 'X', '9107', 'A', 'V', '6035']
Example Output: M, 9359, T, 53, 637, K, G, f, w, e, 1489, u, L, y

Example Input: 9, 11, ['8137', 'j', 'J', 'B', 'K', '3397', 'e', '7973', 'C', 'd', '5141', 'M', 'I']
Example Output: 5141, d, C

Example Input: 1, 9, ['3091', '3227', 'w', '8029', '6103', '4045', '7053', '595', 'F', '6415', '5859', '8507', '1019', 'A', '3633']
Example Output:
F, 595, 7053, 4045, 6103, 8029, w, 3227, 3091