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.

Input: Consider Input: 6, 10, ['e', 'D', 'T', 'g', '5105', 'H', 'Y', 'F', '4863', '9789', '4361', 'U']

Output: 9789, 4863, F, Y, H


Input: Consider Input: 7, 7, ['T', '9701', 'f', 'Z', '7427', 'r', 'j', '6897', '447', '5751', '2961', '3391', '9629', '2433']

Output: j


Input: Consider Input: 20, 22, ['373', 'U', 'I', '8975', '2451', 'w', 'y', 'g', '4313', '6247', '5687', '8197', '5175', '3689', 'X', '1261', 'T', '8139', '9079', '8823', 'u', 'R', '9361']


Output: R, u, 8823