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.

[Q]: 2, 15, ['r', '3527', 'Z', '9011', 'm', '879', '5305', '7153', 'c', '3567', 'd', '2319', 'M', 'y', '7703', '4899', 'G']
[A]: 39464


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


[Q]: 3, 18, ['P', '1429', '3883', '1883', 'u', 'K', 'N', 'j', 'u', 'H', 'y', '7785', '7371', '6869', '1613', '6515', '695', 'U', 'u']
[A]:
36614