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, 6, ['j', 'j', 'W', '1351', 'B', 'e', '2585', '8831', '7465']
[A]: 1351


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


[Q]: 6, 16, ['P', '8933', '2757', 'y', 'p', '6687', '6903', 'S', 'b', '7221', 'V', 'B', '3633', 'G', '1209', 'J', '641', '1449', 's', 'w', 'C', '5801', 'Y']
[A]:
25653