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:
6, 12, ['E', 'U', '5441', 'w', 'J', '7305', '3875', '2693', 'J', '7631', 'd', '7369']

Ex Output:
7369, d, 7631, J, 2693, 3875, 7305


Ex Input:
2, 5, ['k', 'G', '8983', 'm', 'H', 'l', 'b']

Ex Output:
H, m, 8983, G


Ex Input:
8, 21, ['f', 'p', '4613', 'b', 'Y', 't', 'p', 'Q', '5633', 'k', 'z', 'f', '4223', 'q', '1513', 'z', '725', '4141', '8681', 'U', '1779', '6517', 'Z', 'f']

Ex Output:

1779, U, 8681, 4141, 725, z, 1513, q, 4223, f, z, k, 5633, Q