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: 6, 12, ['b', 'l', 'r', '6641', 'r', '5747', 'j', 'E', 'p', 'n', 'R', 'M', '4007', 'r']

Output: M, R, n, p, E, j, 5747


Input: Consider Input: 2, 2, ['a', 'i', 'i', '125', '997', 'u', 'U', '2931', 'q']

Output: i


Input: Consider Input: 21, 25, ['n', 's', '1743', 'L', 'l', '7865', '967', '7277', '9901', '947', '4091', 'n', '6941', 'A', 'e', '6433', 'M', 'L', '1039', 'e', '4121', 'R', 'B', 'l', 'a']


Output: a, l, B, R, 4121