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, 7, ['k', 'm', 'W', '641', 'X', 'B', '897']
[A]: 1538


[Q]: 10, 14, ['E', 'P', 'm', 'o', '4203', '657', 'Z', '9975', 'p', '4013', 'M', 'm', '7369', 'x', 'K', 's', '9411', '9787', '4293', '8229']
[A]: 11382


[Q]: 4, 15, ['8607', '7387', 'G', 'R', '2499', '3211', 'r', '3677', 'X', '6553', '3077', 'T', '3569', '2575', '5533', '3471', 'V', 'R', 'n']
[A]:
30694