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]: 2, 9, ['3707', 'J', 'H', '8907', '597', 'Z', '9725', 'g', 'R']
[EX A]: 19229

[EX Q]: 2, 4, ['3155', '581', 'N', '153', 't', '7941', '6065']
[EX A]: 734

[EX Q]: 3, 3, ['K', '4175', '6479', '215', 'r', '8349']
[EX A]:
6479