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.

13, 19, ['5529', 'd', 'W', 'b', 'I', '65', '9995', '6331', '9373', 'V', '8389', 'E', '7455', '105', 'W', 'r', '7733', '7607', 'L', '5553', 'e']
22900

1, 4, ['2025', '6689', '1227', '3943', 'z', '719', '8941', 'b', 'V', 'w', '5267', '2403', 'N', '5771']
13884

8, 9, ['P', 'V', '5567', 'm', 'V', '9533', '2381', '1095', '835', 'B', 'z', 'J', 'H', 't', 'b', 'z', 'e']

1930