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: 4, 16, ['Q', 'Y', 'm', '2899', '3855', 'b', '4503', '3635', 'G', 'S', '9523', 'n', 'e', '6307', '8509', '9013', 'A']

Output: 9013, 8509, 6307, e, n, 9523, S, G, 3635, 4503, b, 3855, 2899


Input: Consider Input: 1, 6, ['609', 'T', 'Q', 'N', 'p', 'b', 'C']

Output: b, p, N, Q, T, 609


Input: Consider Input: 9, 16, ['6897', '9659', '6529', 'V', 'I', '5983', '9203', 't', '7173', 'y', 'h', '2743', 'T', '3839', '4641', '5095', '1785', 'd']


Output: 5095, 4641, 3839, T, 2743, h, y, 7173