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.

Ex Input:
5, 8, ['U', 'K', '8895', '1097', 'q', '519', '8805', '7471', 'K', '623', '8317']

Ex Output:
7471, 8805, 519, q


Ex Input:
3, 15, ['9151', '9293', 'G', 'E', 'M', '1593', '9963', '7191', '4421', 'Q', '7315', 'i', '3041', 'W', '8913', 'v']

Ex Output:
8913, W, 3041, i, 7315, Q, 4421, 7191, 9963, 1593, M, E, G


Ex Input:
7, 8, ['8565', '7681', 'N', '5867', '4951', '4761', '3639', '4005', '2043']

Ex Output:

4005, 3639