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 find all elements of A from the ith element to the jth element, reverse the order in which they occur, and then concatenate them to output the resultant string. 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. Perform the operations in order, i.e., do not concatenate the elements and then reverse the string.

Input: Consider Input: 22, 22, ['D', 'U', 'O', '2609', '7785', 'F', 'v', 'g', '5451', 'W', 'D', 'n', 'R', '1483', 'o', 't', '6741', 's', 'u', '9611', 'Y', '1261', '8023']

Output: 1261


Input: Consider Input: 8, 16, ['n', 'M', 't', '2553', 'F', 'R', 'g', '415', '8313', '7105', '7725', '6881', '7531', 'N', 'B', '3295', '7989', '2863', 'y', 'N', 'Y', 'C', '5887', '2661', '155', '5889', '8433', 's', 'i', 'b']

Output: 3295BN75316881772571058313415


Input: Consider Input: 6, 9, ['a', '7861', 'e', 'Y', 'E', 'X', '9009', 'j', 'B', 's', 'E', 'T', '3685', 'j', 'V', '2917']


Output: Bj9009X