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:
2, 25, ['R', 'g', '5585', '1059', '3917', '8711', 'K', 'C', 'o', '4587', '7493', 'P', 'B', '5951', 'd', 'b', 'B', '851', 'S', '4589', 'P', '1471', 'Z', 'x', '9477']

Ex Output:
53691


Ex Input:
15, 25, ['Y', '2539', 'B', 'Q', 'M', 'H', 'r', 's', '5577', 'Y', 'X', '6419', 'b', 'H', '4237', '5329', 'Q', 'S', 'X', '9677', 'P', '2347', 'H', '213', 'Q']

Ex Output:

21803