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:
1, 2, ['1907', '1489', 'm', '4571', 'a']

Ex Output:
3396


Ex Input:
5, 10, ['3907', '1629', 'v', '6711', '8347', 'E', '4067', 'T', '1665', '5735', '4879']

Ex Output:
19814


Ex Input:
3, 21, ['4671', '3079', 'E', '8131', 'o', 'J', 'H', 'x', '6607', 'y', 'p', '6053', '417', '3277', '3137', 'B', 'G', 'A', '8081', '981', '3973', '5539', 'w', 'O', '8789', 'I', 'N']

Ex Output:

40657