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: 1, 2, ['o', 'Y']

Output: Y, o


Input: Consider Input: 13, 13, ['W', 'L', '3173', '2971', '8095', '5985', 't', '871', 's', '6509', '5293', 'Q', 'i']

Output: i


Input: Consider Input: 6, 12, ['k', '4809', 'A', '3939', 'C', '6075', '1533', '5743', 'D', 'U', '1249', '4295', '5617', '9615', 'z', '973', 'w', 'N']


Output: 4295, 1249, U, D, 5743, 1533, 6075