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 return the sum of all the numerical elements in the list A between the positions i and j (including positions i and j). Return 0 if no numerical element is present in the list between the given ranges. 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.

Ex Input:
11, 27, ['1573', '6065', '869', '77', '9665', 'o', '8359', 'g', '3557', '521', '6797', '5117', '3921', '5707', 'k', '9855', '8415', 'Y', 'l', 'S', '385', '9063', '8975', '2047', 'H', 'p', 'p']

Ex Output:
60282


Ex Input:
11, 14, ['7277', '3335', 'z', 'R', 's', '8267', 'q', '2743', 'w', '4003', 'G', 'O', 'Y', '4063', 'q', '7001', '7381', 'D', '6247', '7211', 'I', '2277', '7543', 'Y', '8243', '3127', 'V', '8709']

Ex Output:
4063


Ex Input:
5, 6, ['4995', '1453', '2219', 'r', 'S', 'n', 'L']

Ex Output:

0