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: 2, 17, ['H', '8389', 'Q', 'q', '3865', '5471', '3007', 'o', 'F', 'H', 'O', 'l', 'y', '3393', '8677', '1465', '4779', '2821', '9541', '971', '2617', 'Q', 'T', 'H', '809', 'G']

Output: 4779, 1465, 8677, 3393, y, l, O, H, F, o, 3007, 5471, 3865, q, Q, 8389


Input: Consider Input: 4, 10, ['N', '5189', '933', '1407', '8007', '535', 'R', 'A', 'c', 'C', 'u', '3009', 'h', 'O', 'F']

Output: C, c, A, R, 535, 8007, 1407


Input: Consider Input: 5, 9, ['m', '4467', '9561', '2267', '9533', 'p', '5345', '2725', '1367', '6327', '1371', 'f', '7393', 'v', 'W']


Output: 1367, 2725, 5345, p, 9533