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:
1, 12, ['Q', 'i', '7971', 'e', 'p', 'z', '5181', 'g', '905', 'G', '733', '321', 'z', '9625', '6641', '6247', '5241', '6799', 'Q', 'y', '6979']

Ex Output:
321, 733, G, 905, g, 5181, z, p, e, 7971, i, Q


Ex Input:
15, 18, ['Z', 'K', '8837', '8023', 'H', '4565', 'u', 'Y', 'o', 'x', 'I', 'u', '941', '5425', 'l', 'L', 't', 'P', 'r', 'G', '7207', '7491', '5969', '6967', '1029']

Ex Output:
P, t, L, l


Ex Input:
2, 6, ['X', 'K', '4937', '1851', '4663', '7997', '9707', '7881']

Ex Output:

7997, 4663, 1851, 4937, K