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, 16, ['e', 'Q', '4017', '1999', '2413', 'v', '4911', 'N', 'x', '3475', '2179', 'o', 'a', '6361', '1723', '6273']

A: 33351
****
Q: 2, 4, ['8181', '9349', '2531', 'S', '5333', '3721', '9641']

A: 11880
****
Q: 10, 17, ['611', 't', 'y', 'K', '5541', '9149', '7507', '4445', 'Z', '8605', 'S', 'H', 'o', 'R', '6705', '3333', 'z', 'p', '441', '2309']

A:
18643
****