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, 3, ['669', '3561', '3989', '6343', '1819', '1139', '6861', 'b', 'M', '6061', '6291', 'z', 'l', '4523', 'I', '3013', '9473', 'N', 'M', 'C', 'N', 'u']

Output: 3989, 3561, 669


Input: Consider Input: 6, 12, ['u', '5921', 'E', '145', '6611', 'G', '701', '1587', '7693', '3491', '8219', 'h']

Output: h, 8219, 3491, 7693, 1587, 701, G


Input: Consider Input: 5, 15, ['3209', '1231', '8107', '8949', 'D', '9497', '9121', 'X', '665', 'I', '313', '361', 'i', 'F', 'L', 'B', 'L', '1311', '7105', 'y', '3879', 'C']


Output: L, F, i, 361, 313, I, 665, X, 9121, 9497, D