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.

Example Input: 12, 14, ['d', 'R', '751', '3261', '789', 'k', 'M', 'Z', 'v', '8895', 'd', '1367', 'S', '4629', '9067', '6449', '8917', '2693', 'N', '6079', 'q']
Example Output: 4629, S, 1367

Example Input: 5, 6, ['7425', '97', '6471', '2915', '3535', '8285', 'n', 'p', '5985', '5773', '5711', 'e', '673']
Example Output: 8285, 3535

Example Input: 18, 24, ['F', 'c', '3551', 's', 'c', '1505', 'k', '167', 'U', 'K', '3975', 'x', 'J', '79', '8057', 'K', '9847', '7693', '725', '181', 'P', 'l', 'o', '2833', '2165', '657']
Example Output:
2833, o, l, P, 181, 725, 7693