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, 2, ['4319', '3495']
Example Output: 7814

Example Input: 9, 21, ['Z', 'Z', '853', '8745', 'L', '4401', 'a', 'L', '8237', 'h', '9163', '1891', '5049', '7075', '1437', '7377', 'E', 't', '837', 'B', 'z', '5629', 'm', 'z', '365', 'M', '8877', '27']
Example Output: 41066

Example Input: 3, 9, ['H', 'd', '9069', 'y', '9577', 'C', '7441', '327', 'x', '7057']
Example Output:
26414