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.

6, 9, ['J', '5177', 'm', '7413', 'T', 'N', '5153', 'S', '8145']
13298

2, 10, ['N', 'K', '4585', 'd', '8219', '3831', 'e', '7037', 'h', 'd', 'c', '577', 'c', '3559', '4059', 'M', '5349', 'V', 'L', '1807']
23672

3, 19, ['3593', 'U', 'r', 'B', 'a', 'u', 'x', 'Y', '8775', 'l', 'W', 'C', 'b', '1527', '555', 'B', 'd', '7065', '5157']

23079