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]: 3, 15, ['l', '7213', '6849', '4327', 'V', 'S', '3773', '2583', 'f', '5031', 'J', '5263', 'w', '9777', '2753']
[A]: 40356


[Q]: 1, 11, ['W', 'c', '8889', '2649', '6183', '1489', 't', 'o', '4925', '4411', 'b', '5657', 'i', 'q', 'z', 't']
[A]: 28546


[Q]: 2, 7, ['3629', 'w', '8543', 'M', 'v', 't', '7565', '5465']
[A]:
16108