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: 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']
Example Output: i, 435, Y, 243, w

Example Input: 2, 5, ['Z', 'L', '6635', '7279', 'T', 'p', '2521', 'A', '2857', 'Q', '6257', 'o']
Example Output: T, 7279, 6635, L

Example Input: 1, 6, ['y', 'U', 'C', '5605', '5305', '9797', '8483', 'v', '1277', '6383', 'r', '1339', 'p', '8859', '703', '4985', '2253', '8165', '2123', 'f', 'f', '6999', '9463']
Example Output:
9797, 5305, 5605, C, U, y