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:
2, 5, ['8407', '1329', '2243', '2547', '5371', '6023', '7139', 'K', '339', '3301', '6771', 'Z', '9983', '17', 'V']

Ex Output:
11490


Ex Input:
2, 16, ['2169', 'o', 'D', '8877', '3351', 'p', 'X', '1143', '9633', 'f', '2507', 'S', '5541', 'B', '4543', 'A', 'f']

Ex Output:
35595


Ex Input:
2, 11, ['2751', '1329', '9249', 'J', '7935', 'm', '3995', 'r', 'd', 'A', 'F', 'L', '1115', '7221', 'e', '6763', 'K']

Ex Output:

22508