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.

Ex Input:
1, 11, ['p', '2293', '3291', '4843', 'i', '1303', 'R', '9315', '2485', '8477', 'V', '9629', 'v', '6959', '3019']

Ex Output:
32007


Ex Input:
3, 15, ['l', '7213', '6849', '4327', 'V', 'S', '3773', '2583', 'f', '5031', 'J', '5263', 'w', '9777', '2753']

Ex Output:
40356


Ex Input:
8, 13, ['i', 'H', '9353', 'u', 'o', '6133', '2815', 'B', 'W', '4383', 't', 'A', 'u', 'L', '5355', '4419', '2837', '2725', 'c', '4295', 'M', '4493', 'V', '7763', '2647']

Ex Output:

4383