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, 19, ['5671', '7557', '3823', '2307', '2763', 'b', 'E', '5081', '4431', '6143', '6939', '9417', '8697', '4175', 'n', '7633', '8723', 'A', '7583', '2081', '7577', '4019', 'q']
[A]: 85272


[Q]: 3, 16, ['1661', '2609', '7987', '619', '6765', '5249', '1377', '8971', 'J', 'o', '4803', 'O', '699', '4415', 'V', '1813', 'j', 'm', 'L']
[A]: 42698


[Q]: 1, 2, ['1321', '545', 'o']
[A]:
1866