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: 1, 6, ['237', 'x', 'Q', 'J', '4629', 'q', '2831', 'i', 'm']

A: 4866
****
Q: 6, 13, ['x', '8293', 'W', 'O', '511', 'y', '9801', '7925', '3353', 'J', 'D', 'J', 'B', '2559', 'j']

A: 21079
****
Q: 8, 21, ['I', '51', '423', '1429', '1867', '4791', '21', 'i', 'O', 'o', 'Q', '3303', 'w', 'b', 'P', 'M', '6245', 'O', 'E', 'T', 'P', '8575', '3509']

A:
9548
****