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: 6, 19, ['M', 'q', 'S', 'C', 'i', 'y', 'L', 'u', '1489', 'e', 'w', 'f', 'G', 'K', '637', '53', 'T', '9359', 'M', 'k', '7709', 'w', '6589', 'X', '9107', 'A', 'V', '6035']

A: M, 9359, T, 53, 637, K, G, f, w, e, 1489, u, L, y
****
Q: 13, 13, ['W', 'L', '3173', '2971', '8095', '5985', 't', '871', 's', '6509', '5293', 'Q', 'i']

A: i
****
Q: 1, 3, ['5219', '9559', 'B', 'A']

A:
B, 9559, 5219
****