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: 3, 16, ['1661', '2609', '7987', '619', '6765', '5249', '1377', '8971', 'J', 'o', '4803', 'O', '699', '4415', 'V', '1813', 'j', 'm', 'L']

A: 42698
****
Q: 6, 7, ['6635', '1537', 'F', 'h', '7965', 'K', '5231', 'K', '3089']

A: 5231
****
Q: 14, 27, ['l', 't', 'S', 'f', '9925', '5423', '7847', 'J', '3341', 'B', '875', '3675', 'X', '9115', '8311', '6751', '2659', '1543', '4043', 'J', 'h', 'Z', 'V', '6937', '4227', 'j', 'f', '903', 'B']

A:
43586
****