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:
3, 3, ['D', 'G', 'm']

Ex Output:
m


Ex Input:
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 Output:
3989, 3561, 669


Ex Input:
4, 6, ['209', 'j', 'v', 'Q', 'N', 'l', '7951', '9093', 'g']

Ex Output:

l, N, Q