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, 5, ['W', 'A', 'm', 'w', 'r', '9705', '1729', 'U', '2171', 'Q', 'Y', 'P', 'O']
[A]: 0


[Q]: 4, 7, ['6307', 'N', '5209', 'M', 'k', 'd', '6933']
[A]: 6933


[Q]: 2, 23, ['u', 'Z', '3211', '4215', '5413', 'o', '8183', 'E', '6925', 'n', '4073', '9887', 'w', '2979', 'A', 'X', 'W', '9373', '8763', 'o', 'r', '5413', 'x', 'b', '7031', '1889', '4901', '699']
[A]:
68435