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: 2, 2, ['R', '979', 'H', 'W', 'y']

A: 979
****
Q: 8, 15, ['6067', 'c', 'T', '2233', '2423', '3393', 'v', '1407', 'Z', '3843', '7121', 'c', '3063', '441', '729', 'E', 'J', '2205', '3681', '5567', 'D', '2753', 'T', 'm', '9101', 'W', 'L', '4417', 'G']

A:
16604
****