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, 11, ['p', '2293', '3291', '4843', 'i', '1303', 'R', '9315', '2485', '8477', 'V', '9629', 'v', '6959', '3019']
Example Output: 32007

Example Input: 8, 9, ['P', 'V', '5567', 'm', 'V', '9533', '2381', '1095', '835', 'B', 'z', 'J', 'H', 't', 'b', 'z', 'e']
Example Output: 1930

Example Input: 14, 15, ['j', 'M', 's', 'd', '7769', '4417', 'd', '9391', 'I', '283', 'K', 'E', '4925', '2391', '319', '5643', '5313', '9525', '2281', 'G', 'X', 'P', '245', 'z', '4559', 'i', 'v', '5953', 't']
Example Output:
2710