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: 6, 13, ['Z', 'h', 'j', 'i', '4335', 'c', 'A', 'O', 'U', '8173', 'N', 'E', '9187', '9911']
Example Output: 17360

Example Input: 5, 9, ['125', 'A', 'E', 'X', 'j', '319', 'm', '7037', 'g', 'D', 'g', '6737', 'z', '5249']
Example Output: 7356

Example Input: 4, 17, ['E', '5555', 'y', '8067', 'G', '4369', '9099', '5083', '805', 'L', 'v', 'Q', 'j', '5807', 'u', '1213', '5809', '2827', 'T', '7767', 'c', 'Z', '2595', '2045', '3697', '3433', 'j', '9235', '491']
Example Output:
40252