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 concatenate all elements of A from the ith element to the jth element, and print 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.

Input: Consider Input: 15, 18, ['u', 'W', 'D', '607', '4111', '1207', 'N', 'T', 'Q', '7755', 'I', '9387', '6501', 't', '901', 'W', 'P', 'F', 'o', 'S', '6809', '1973', '3791', '8015', 'x', 'm', '4859', 'V', 'G']

Output: 901WPF


Input: Consider Input: 12, 16, ['V', 'b', '5681', '3457', '2951', 'h', 'B', 'W', '4177', 'P', 'T', '2747', '7697', '303', '5563', '2593', 'X', 'v', '8885', 'E']

Output: 2747769730355632593


Input: Consider Input: 1, 10, ['5751', 'Y', '6431', '1245', 'j', '8703', '5567', '6801', 'd', '9853', '1405', '5655']


Output: 5751Y64311245j870355676801d9853