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]: 8, 9, ['3587', '5903', 'B', '9671', 's', 'A', '7259', '6961', '2601', '9719']
[A]: 9562


[Q]: 5, 6, ['937', '3595', '1279', '8705', '3587', '5879']
[A]: 9466


[Q]: 9, 14, ['5601', '3213', 'A', '6207', '2021', 'W', 'J', '5373', '3281', 'l', 'd', '8615', '5085', '4293', '1017', 'N']
[A]:
21274