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]: 2, 2, ['D', 'l', 'g', '151', 'S']
[EX A]: l

[EX Q]: 6, 18, ['r', '3855', 'f', 'g', 'q', 'R', 'u', '509', '6629', '9621', '1285', 'C', '3463', 'q', 'X', 'q', 'S', 't', 'L', 'P', 'd', '3963', 'A']
[EX A]: t, S, q, X, q, 3463, C, 1285, 9621, 6629, 509, u, R

[EX Q]: 8, 17, ['P', 'C', '9747', '4759', '8829', 's', 'E', '9557', 'Y', 'Q', '8255', '2185', '5707', '5135', '8929', 'k', 'L', 'C']
[EX A]:
L, k, 8929, 5135, 5707, 2185, 8255, Q, Y, 9557