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: 1, 6, ['7349', 'S', '4839', 'R', '4443', '7569', '7307']

A: 24200
****
Q: 5, 8, ['j', '1099', 'J', 'l', 'E', '6559', '6181', '4441']

A: 17181
****
Q: 12, 28, ['n', 'v', '8155', 'A', '4657', 'F', 'K', 'N', 'l', 'V', 'T', '6471', '9407', '5459', '8081', 'c', '433', 'Z', 'U', '3757', 'c', '583', '129', '5351', 'f', 't', '6411', '2521', '7707']

A:
48603
****