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]: 1, 2, ['E', 'z']
[A]: 0


[Q]: 3, 4, ['6203', 'g', '471', 'j', 'o', '9679', 'M', '5459', 'y', '1929', '1649', 'C']
[A]: 471


[Q]: 5, 11, ['B', '3683', '7921', '4231', '9577', 'c', '3245', 'U', '8033', 'f', '1413', '4719', '8503', 'F']
[A]:
22268