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: 7, 9, ['z', 'd', '6897', 'E', 'D', 'I', 'Y', 'j', '3567']
Example Output: 3567, j, Y

Example Input: 6, 8, ['p', '5605', 'K', 'D', 'U', '1037', 'G', '2715', 'g', '5389', '6301', 'q', 'y', '8099', '833', '9117', '4655', '9003']
Example Output: 2715, G, 1037

Example Input: 2, 4, ['e', '7951', 'z', 'q', '3639', '6667', '247', '1921', '9395', 'p', '7981', '6107', 'f', 'k', '6547', 'R', '9593']
Example Output:
q, z, 7951

