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.

Input: Consider Input: 11, 15, ['L', 'G', 'E', '7273', '5731', 'R', 'z', 'S', 'n', 'm', 'W', '9585', 'e', '5389', 'W', 'q']

Output: W, 5389, e, 9585, W


Input: Consider Input: 7, 9, ['z', 'd', '6897', 'E', 'D', 'I', 'Y', 'j', '3567']

Output: 3567, j, Y


Input: Consider Input: 4, 16, ['9619', 'B', 'G', '3301', 's', '8521', 's', '2111', '7335', '2049', 'G', '9939', 'g', '843', 'V', '9655', 'd', 'R', '8729']


Output: 9655, V, 843, g, 9939, G, 2049, 7335, 2111, s, 8521, s, 3301