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]: 3, 10, ['W', '9833', '7687', 'c', '9237', 'g', '4971', 'x', '1419', '9145']
[EX A]: 9145, 1419, x, 4971, g, 9237, c, 7687

[EX Q]: 5, 15, ['G', 'e', '9375', 'b', '6245', '5779', '6633', '9625', 'P', 'S', 'B', 'v', 'H', 'e', '3791', '849', 'q', '3993', '1387', '5683']
[EX A]: 3791, e, H, v, B, S, P, 9625, 6633, 5779, 6245

[EX Q]: 2, 10, ['W', '9963', 'U', 'J', '6053', '8155', 'Z', '7505', 'A', '3217', '3685', 'F', '323', 'V', 'r', 'S', 'D', 'A', 'F', '1249', '381', 'i']
[EX A]:
3217, A, 7505, Z, 8155, 6053, J, U, 9963