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, 8, ['d', 'E', '5523', 'O', '863', 'X', 'p', '9873', 's', '7623']

Output: 9873, p, X


Input: Consider Input: 6, 10, ['Q', '3805', '8965', '6141', '1819', 'w', '243', 'Y', '435', 'i', '7489', '5167', 'X', '4641', 'T', 'B', 'g', 'j', 'j', 'c', 'H', 'J', '3231', '9277']

Output: i, 435, Y, 243, w


Input: Consider Input: 2, 12, ['u', '6663', '7747', '9251', 'N', '1385', 'u', '2007', '6411', '9045', '6285', 'H', '7281', 'j', 'J', 'G', 'l', 'A', '7665']


Output: H, 6285, 9045, 6411, 2007, u, 1385, N, 9251, 7747, 6663