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, 10, ['q', 'w', '3381', '6701', '363', 'h', '8369', '339', '2135', '8767']
Example Output: 8767, 2135, 339, 8369, h, 363, 6701, 3381, w, q

Example Input: 12, 15, ['3165', '5351', 't', 'A', '4711', 'N', '9903', '9735', 'X', 'p', 'C', '9717', '8599', 'p', 'M', 'O', '6341', 'k', '7231', '8311', 'l', '3315', 'j', 't', 'i', '4547', 'N']
Example Output: M, p, 8599, 9717

Example Input: 4, 7, ['t', 's', '1859', '6939', '97', '2819', '4663']
Example Output:
4663, 2819, 97, 6939