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, 6, ['j', 'j', 'W', '1351', 'B', 'e', '2585', '8831', '7465']

A: 1351
****
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, 17, ['3105', 'i', 't', '1727', 'H', 'B', '7653', '8507', 'F', '591', 'o', '4761', '3145', 'Q', 'd', 'U', 'Z', 'b', 'J', '7339', '2815', 'K', 'a', 'E', '6371']

A:
17004
****