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]: 10, 16, ['w', 'o', 'c', 'H', '1789', 'M', 'C', 'n', '6019', '773', '9303', 'N', 'o', 'z', '7385', 'k', 'o', '6073', 'E', 'o', 'k', '8665', '6121', 'N', '5437', '9523', 't', '3565']
[EX A]: k, 7385, z, o, N, 9303, 773

[EX Q]: 5, 5, ['Z', '873', 'V', 'F', '7741', '2623']
[EX A]: 7741

[EX Q]: 3, 4, ['2787', 't', '3087', '8645', '7473', '1609']
[EX A]:
8645, 3087