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: 3, 6, ['x', '7739', '1923', '5829', '2215', 'M', '1901', 'A', '1585', 'W', '2433', '8947', '2217', '7879', 'i', '8543', '7457']
Example Output: 9967

Example Input: 5, 9, ['6337', 'o', '5881', 'w', 'R', 'M', 'z', 'y', 'W']
Example Output: 0

Example Input: 3, 9, ['4711', 'P', 'P', 'F', '8283', 'C', '7487', 'W', 'W', '8739', '7475', 'u', '6385', '9905', '2471', 'I', '9413', 'R', 'S']
Example Output:
15770