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: 4, 13, ['E', '7949', 'd', 'K', '457', 'R', '181', 'q', '8367', '8613', 'S', '9637', '49', 'l', 'z', '9493', 'H', 'Q', '1855', 'H', 'x', '4215', 'j', '6517', '51', '3459']

Output: 49, 9637, S, 8613, 8367, q, 181, R, 457, K


Input: Consider Input: 3, 5, ['g', '4461', 'G', 'M', 'q']

Output: q, M, G


Input: Consider Input: 13, 20, ['D', 'C', '7007', '4539', '1245', '1155', '5101', '541', '4175', 'p', '1137', '6339', '2111', 'a', '8443', 'P', 'l', 'K', '2413', '9607', '3165', 'L', 'c', '8951', 'K', 'k', 'Q', 'i']


Output: 9607, 2413, K, l, P, 8443, a, 2111