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.

[EX Q]: 7, 9, ['H', 'I', 'h', 'S', 'u', '3669', 'z', 'y', 'E', 'E', '2601', 't', 'N']
[EX A]: E, y, z

[EX Q]: 7, 15, ['H', 'F', 'F', 'V', 'K', 'q', 'l', '195', '3065', 'O', '9121', '8583', '5221', '239', '7321', 'j', '2513', '835', '951', '1119', '2045', '5479', 'u', 'p', 'o', 'z']
[EX A]: 7321, 239, 5221, 8583, 9121, O, 3065, 195, l

[EX Q]: 2, 6, ['s', 'W', 'X', '5921', 'x', 'j', '405', 'H', 'e', '8447', '4911']
[EX A]:
j, x, 5921, X, W