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, 2, ['5605', '6415']

A: 12020
****
Q: 1, 1, ['d', '6481']

A: 0
****
Q: 3, 16, ['2199', '5555', 'w', '5047', '5493', 'F', '8875', '7561', 'n', '7887', 'j', '6321', 'T', 'v', 'n', 'R', 'm', 'K', 'h', '4835', 'J', '7363', '9739', '819', '6277']

A:
41184
****