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, 9, ['k', 's', 'q', 'g', 'o', '7949', '3531', 'j', '1005', 'c', 'P', 'Y', '6885', '1985', 'A', 'P', 'm', 'u', '1685', '8895']
Example Output: 1005, j, 3531, 7949

Example Input: 1, 3, ['x', 'y', '4027', '3877', '4635', '7915', '1677', '6453', 'w', '2893', '4615', 'h']
Example Output: 4027, y, x

Example Input: 2, 11, ['369', '1989', '2263', '4627', 'P', '2987', '8283', '9017', 'C', '417', 'e', '4751', 'x', 'k']
Example Output:
e, 417, C, 9017, 8283, 2987, P, 4627, 2263, 1989