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, 8, ['6901', '3901', '5101', '4297', '1099', 'q', 'z', '6615', 'z', '6859']

A: 21013
****
Q: 4, 10, ['1081', 'm', 'm', '489', '9481', '5741', '1049', 'p', 'd', '7785', 'm', '4905', '1343', 'A', '9931', 'C', 'v', 'l']

A: 24545
****
Q: 10, 12, ['6753', '5645', '6383', '4139', '579', 'r', 'l', '3277', '8855', '4557', 'Q', 'Q', '5407', 'Y']

A:
4557
****