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: 2, 2, ['D', 'l', 'g', '151', 'S']
Example Output: l

Example Input: 3, 13, ['q', 'd', '5865', 'G', '3611', '2967', 'Q', 'C', 'T', '317', '4919', '7197', '7257', '6157', 'I', 'f', '8011', 'T', 'z', '4923', 's', '2963', '4001', 'G', 'C', 'i', '9907']
Example Output: 7257, 7197, 4919, 317, T, C, Q, 2967, 3611, G, 5865

Example Input: 5, 8, ['M', 'u', '5357', '485', '9531', '3205', 'L', '4643', '975', '3315', '1839', '8479', '3317', '9943', '4909', '879', 'd', 'E']
Example Output:
4643, L, 3205, 9531