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.

Example Input: 1, 6, ['a', '9091', 'I', '4849', 'O', '2435', 'v']
Example Output: 16375

Example Input: 1, 2, ['1907', '1489', 'm', '4571', 'a']
Example Output: 3396

Example Input: 1, 18, ['P', '4995', 'J', 'v', 'H', '1379', 'f', 'p', '1577', 'Z', '5295', '3065', '8311', 'E', 'o', 'o', '3417', '113']
Example Output:
28152