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 Q]: 5, 11, ['9535', 'L', '5957', 'm', 'B', 'W', '2105', '4959', 'f', '395', 'a', 'W', 'C']
[EX A]: 7459

[EX Q]: 1, 10, ['9139', 'F', 'e', 'F', '8979', '831', '6811', '3677', '2937', '1001']
[EX A]: 33375

[EX Q]: 9, 17, ['F', '757', '3929', '4525', '8599', '2369', '9863', '6187', '5315', 'I', '2415', 'L', '5647', '729', '5275', 'D', '5705', 'M', 'P', '9387', 'D', 'z', '7717']
[EX A]:
25086