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: 4, 8, ['6669', 'G', 'y', '129', 'y', 'x', 'w', 'C', 'J']

A: 129
****
Q: 8, 14, ['i', '2929', '9353', 'T', '5451', 'n', 'y', '2861', 's', 'G', '7717', '3833', '3753', 'u', 'E', 'T', 'I']

A: 18164
****
Q: 6, 12, ['Z', 'C', 'a', 'G', '3673', '2219', '4541', 'g', 'K', 'A', 'Z', '1391', 'h', '6115', 'M', '7343', '831']

A:
8151
****