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]: 13, 17, ['6167', 'd', 'L', '2637', 'z', 'w', '7935', 'm', 's', 'K', 'E', 'q', 'k', 'V', 'R', '9101', 'l', '847', 'J', '3933', '2819', 'C', '2147']
[EX A]: l, 9101, R, V, k

[EX Q]: 6, 8, ['p', '5605', 'K', 'D', 'U', '1037', 'G', '2715', 'g', '5389', '6301', 'q', 'y', '8099', '833', '9117', '4655', '9003']
[EX A]: 2715, G, 1037

[EX Q]: 1, 3, ['669', '3561', '3989', '6343', '1819', '1139', '6861', 'b', 'M', '6061', '6291', 'z', 'l', '4523', 'I', '3013', '9473', 'N', 'M', 'C', 'N', 'u']
[EX A]:
3989, 3561, 669