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: 16, 21, ['3061', 'H', '4673', 'A', '9345', 'I', '5195', '4173', '4359', 'z', '7993', 'C', 'q', '6529', 'q', 'D', 'T', 'C', '3663', '9075', '8399', '4459', 'B', '9147', 'C']

Output: 8399, 9075, 3663, C, T, D


Input: Consider Input: 9, 13, ['p', 'R', '3789', '1553', '9085', '249', '2895', '9605', 'M', 'Q', 'C', '8795', '1477', '7387']

Output: 1477, 8795, C, Q, M


Input: Consider Input: 2, 18, ['1671', 'a', 'h', 'g', 'b', '8287', 'G', '5671', '293', '4971', 'v', '4945', '6663', '9033', '5617', '1149', '3003', '1761', '5035', '6439', '7945', 'y', 'B', '9007', '9061', 'H']


Output: 1761, 3003, 1149, 5617, 9033, 6663, 4945, v, 4971, 293, 5671, G, 8287, b, g, h, a