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: 9, 10, ['H', 'm', 'Y', 'X', '467', '3457', '3339', 'P', '9233', 'o', 'S', '5815', 'q', 'g', 'X', 'v', '3187', 'y', '6409', 'V', '4945', '1549', '5233', 'd', 'j', '1471']

Output: o, 9233


Input: Consider Input: 8, 11, ['4805', 'J', '5591', 'u', 't', '9497', '6823', 'L', '1507', '2921', 'W', '6021', 'X', 'U', 's', '1703']

Output: W, 2921, 1507, L


Input: Consider Input: 3, 10, ['5851', 'd', '5105', '6021', 'P', 'o', 'B', 'p', '1969', 'X', '4555', '3075', '3677', 'W']


Output: X, 1969, p, B, o, P, 6021, 5105