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: 11, 15, ['C', 'E', '9009', '9169', 'k', 'z', 'O', 'X', 'q', '2333', 's', 'H', '1145', 'a', '3773', '4701', '955', 'c', 'U', '3643', 'j', 'u', '5153', 'w', '721', 'S', 'I']

A: 4918
****
Q: 3, 5, ['3515', '4581', '8863', '2037', '7899', 'N']

A: 18799
****
Q: 12, 13, ['521', '8595', 'O', 'z', '2067', 'r', '7315', '5915', '5653', 'n', 'j', 'l', '4037', 'k', 'p', 'M', 'E', 'G', 'K', '8075', 'C', '8763']

A:
4037
****