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: 10, 15, ['n', '4807', 'a', 'Q', '3781', 'h', '1553', 'n', 'J', 'L', 'M', '3781', '6375', '2429', 'O', '1687', 'L', 'S', '607', '9433']

A: 12585
****
Q: 6, 23, ['s', '5425', '7485', 'I', 'r', 'I', '3943', '4067', '3773', '2459', '1525', '2093', '1103', '7373', 'h', 'j', '3209', 'o', 'Q', 'I', '1295', '4569', '4301', 'C', 'N', '269']

A: 39710
****
Q: 12, 18, ['U', '9571', 'N', '7123', '6435', '8079', 'Z', '6573', 'l', '8051', 'f', '6777', '7175', '9877', 'e', '8387', '3573', 'r', 'm', '1213', '7111', 'M', '27', 'a', '6549', 'p', 'p', '8605', '2443']

A:
35789
****