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:
10, 16, ['w', 'o', 'c', 'H', '1789', 'M', 'C', 'n', '6019', '773', '9303', 'N', 'o', 'z', '7385', 'k', 'o', '6073', 'E', 'o', 'k', '8665', '6121', 'N', '5437', '9523', 't', '3565']

Ex Output:
k, 7385, z, o, N, 9303, 773


Ex Input:
2, 8, ['8003', '2995', '2741', '3893', '2919', '3583', '7387', 'k']

Ex Output:
k, 7387, 3583, 2919, 3893, 2741, 2995


Ex Input:
1, 7, ['3069', 'H', 'e', '8667', '1393', '9573', '6487', '4395', 'J']

Ex Output:

6487, 9573, 1393, 8667, e, H, 3069