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


[Q]: 21, 27, ['2789', '3875', '2351', 'Y', '1127', 'J', 'Z', '5187', 'c', '8115', '3459', 'Y', 'f', 'o', 'L', 'H', '2931', '879', 'L', 'e', '3745', '173', 'v', 'W', '9393', 'Y', '7651']
[A]: 20962


[Q]: 5, 6, ['573', '4527', '2077', '3295', '6557', 'F', 'b', 's', '721', '8851', 'l', '4149', 't', 'X', 'V', 'o', '5319', 'N']
[A]:
6557