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.

4, 25, ['5003', '1565', '5397', '415', '6045', '9119', '3383', '5449', 'v', 'C', 'J', 'w', '7791', 'F', 'O', '8827', '7171', '2709', 'f', 'W', 'P', '5175', 'D', '135', 'W', '7021', 'T', 's', '7949']
56219

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']
85272

2, 4, ['5433', 'E', '7151', '2995']

10146