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, 6, ['e', 'T', 'w', 'K', 'D', 'l', 'S']

Ex Output:
l, D


Ex Input:
1, 6, ['y', 'Q', 's', '1195', 't', '6513', '3909', 'm', '4519', 'm', 'R', 'S', 'K', '9305', 'E', 'Z', '1691', 'c', 'G', '3775', '4921', '6261', 'C', 'F']

Ex Output:
6513, t, 1195, s, Q, y


Ex Input:
4, 10, ['X', '5429', '1279', '1805', '5039', '1631', 'L', '9153', '1537', '6793', 'a']

Ex Output:

6793, 1537, 9153, L, 1631, 5039, 1805