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: 1, 4, ['3757', 'z', '9029', '6903', '7185']

A: 19689
****
Q: 5, 15, ['5049', '2581', '4617', 'b', 'c', 'z', '8247', 'd', '1413', '7797', 'K', 'T', '9009', 'V', '5179', '1643', '3923', '4885', 'j', '6717', 'D', 'D', 'O', '5777', 'W', 'J', '6267', 'e']

A:
31645
****