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, 17, ['J', 'A', '1069', 'g', '2511', 'k', 'K', '93', '6487', 'f', '2903', '741', 'u', 'b', 'J', 'h', '6937', '4393', '3449', 'V']

Output: 6937, h, J, b, u, 741


Input: Consider Input: 12, 16, ['h', '8787', '9969', '867', 'p', 'n', 'C', '1503', '5801', 'N', '3399', '8289', 'u', 'l', '267', 'W', 'd', 'h', 'x', '1443', '253', 'a', '697']

Output: W, 267, l, u, 8289


Input: Consider Input: 4, 7, ['q', 'u', '1605', '7411', '7191', '9569', '3271', 'c', '8257']


Output: 3271, 9569, 7191, 7411