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:
3, 18, ['P', '1429', '3883', '1883', 'u', 'K', 'N', 'j', 'u', 'H', 'y', '7785', '7371', '6869', '1613', '6515', '695', 'U', 'u']

Ex Output:
36614


Ex Input:
2, 4, ['8181', '9349', '2531', 'S', '5333', '3721', '9641']

Ex Output:
11880


Ex Input:
10, 17, ['3113', '367', '3067', '2735', '2505', '429', 'W', 'U', '3375', 'W', '6641', '2091', 'A', 'n', '1169', 'L', '4891', 'A', 'k', '2577', 'M', 'F', 'p', '8421', 'W', '4803', 'k', 'a', '7577', 's']

Ex Output:

14792