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, 10, ['E', '9369', '9109', '5383', '4905', 'y', '8423', 'H', 'l', 'c', '1289', 'r', 'Y', '107', '4483', '369', 'q', 'U']

Output: c, l, H, 8423, y, 4905, 5383, 9109, 9369, E


Input: Consider Input: 14, 15, ['D', '2223', '891', '3909', 'c', 'c', '6109', '4333', 'i', '2463', '5563', 'm', 'E', 'J', '3029', 'R', '3811', '1339', '2655', '2221', '2163', 'D', '8787', '983', 'k', 'z']

Output: 3029, J


Input: Consider Input: 5, 16, ['l', 'q', '9947', '1563', 'P', 't', 'c', '9669', '1781', '3511', '7667', 'O', 'H', 'q', '4985', 'K', 'h']


Output: K, 4985, q, H, O, 7667, 3511, 1781, 9669, c, t, P