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.

Input: Consider Input: 1, 2, ['31', 'Y', 'S', 'K', '251', '837']

Output: Y, 31


Input: Consider Input: 8, 15, ['I', '6755', 'G', '711', '9777', 'I', 'o', 'u', '2371', 'w', 'S', '4059', '8399', '6755', 'p', '8637', 'k', '5639', 'u', 'c']

Output: p, 6755, 8399, 4059, S, w, 2371, u


Input: Consider Input: 3, 12, ['4077', 'N', 'l', 'e', 'H', '945', '3445', '3415', '2943', '2755', 'W', '881', 'M', 'i', 'q', 'w', '8729', '2433']


Output: 881, W, 2755, 2943, 3415, 3445, 945, H, e, l