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]: 12, 16, ['h', '8787', '9969', '867', 'p', 'n', 'C', '1503', '5801', 'N', '3399', '8289', 'u', 'l', '267', 'W', 'd', 'h', 'x', '1443', '253', 'a', '697']
[EX A]: W, 267, l, u, 8289

[EX Q]: 3, 16, ['R', 'O', 'i', '1305', 'b', 'P', 'H', '9575', '2307', 'S', 'K', '3463', 'O', '6433', 'i', 'I', 'z']
[EX A]: I, i, 6433, O, 3463, K, S, 2307, 9575, H, P, b, 1305, i

[EX Q]: 3, 6, ['2685', '6893', 'H', 'N', '4431', 'M', '8657', '5355', 'c', '7225', 'K']
[EX A]:
M, 4431, N, H