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: 5, 5, ['K', 'K', '7981', '8055', '9351']
Example Output: 9351

Example Input: 13, 17, ['6167', 'd', 'L', '2637', 'z', 'w', '7935', 'm', 's', 'K', 'E', 'q', 'k', 'V', 'R', '9101', 'l', '847', 'J', '3933', '2819', 'C', '2147']
Example Output: l, 9101, R, V, k

Example Input: 1, 7, ['891', 'Q', 'G', 'N', 'p', '9579', 'D', 'A', 'G', '5227', '311', 'O', 'E']
Example Output:
D, 9579, p, N, G, Q, 891