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.

Q: 5, 6, ['L', '8025', '6699', '6437', 'G', 'Q', 'H', '9831']

A: Q, G
****
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']

A: k, 7385, z, o, N, 9303, 773
****
Q: 5, 20, ['U', '9529', 'C', 'l', '297', 'O', 'x', 'F', '1933', '1057', '3237', 'J', 'd', '6829', 'G', '4391', '8783', 'y', '3245', '8871', 'Q', '3027', '4277', 'b', '9097', '8779', 'D', 'W', '7197']

A:
8871, 3245, y, 8783, 4391, G, 6829, d, J, 3237, 1057, 1933, F, x, O, 297
****