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 Input:
9, 10, ['H', 'm', 'Y', 'X', '467', '3457', '3339', 'P', '9233', 'o', 'S', '5815', 'q', 'g', 'X', 'v', '3187', 'y', '6409', 'V', '4945', '1549', '5233', 'd', 'j', '1471']

Ex Output:
o, 9233


Ex Input:
4, 10, ['N', '5189', '933', '1407', '8007', '535', 'R', 'A', 'c', 'C', 'u', '3009', 'h', 'O', 'F']

Ex Output:
C, c, A, R, 535, 8007, 1407


Ex Input:
5, 12, ['h', 's', 'R', 'F', '5235', 'x', '3981', '6745', 's', '207', '8349', 'M', 'e', '4231', 'u', '1535', '4299']

Ex Output:

M, 8349, 207, s, 6745, 3981, x, 5235