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: 5, 23, ['6187', 'j', '9129', 'n', 'D', '6181', 'H', 'c', 'V', 'w', '4481', '9115', '1067', 'H', 'a', '1421', '7129', 'S', 'D', '6027', '8845', '3827', 'L']

A: 48093
****
Q: 8, 8, ['9433', '6635', 't', '4425', 'R', '5893', 'z', 'P', 'V', 'f']

A: 0
****
Q: 1, 14, ['j', '8915', '1845', 'x', '6147', 'y', '9593', 'l', '5215', 'f', '3721', 'B', '4419', '7937', 'l', '4843', 'L', 'W']

A:
47792
****