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:
6, 10, ['Q', '3805', '8965', '6141', '1819', 'w', '243', 'Y', '435', 'i', '7489', '5167', 'X', '4641', 'T', 'B', 'g', 'j', 'j', 'c', 'H', 'J', '3231', '9277']

Ex Output:
i, 435, Y, 243, w


Ex Input:
1, 6, ['J', '3417', '2497', '9895', '4305', '1467', '4903', '203']

Ex Output:
1467, 4305, 9895, 2497, 3417, J


Ex Input:
1, 6, ['7859', '7917', 'O', '4983', '7267', '947', '997', 'l', '1721', '3775', '1899', 'y']

Ex Output:

947, 7267, 4983, O, 7917, 7859