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: 12, 14, ['d', 'R', '751', '3261', '789', 'k', 'M', 'Z', 'v', '8895', 'd', '1367', 'S', '4629', '9067', '6449', '8917', '2693', 'N', '6079', 'q']

Output: 4629, S, 1367


Input: Consider Input: 3, 12, ['9871', 'O', '6889', '9613', '5667', '9453', 'H', '3871', 'K', 'x', 'g', '27', 'P', 'J', 'Y', 'y', '9047', 'H']

Output: 27, g, x, K, 3871, H, 9453, 5667, 9613, 6889


Input: Consider Input: 1, 6, ['7357', 'B', 'S', '3107', '3705', 'D', 'l', '9563', '2985']


Output: D, 3705, 3107, S, B, 7357