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: 2, 7, ['3295', '2909', '8081', '8299', '8979', 'J', 'V', 'r', '2403', '5589', '6875', '9181', '6547', 'k', 'n']

A: 28268
****
Q: 2, 6, ['2495', '83', '1257', '9157', 'z', 'Y', '8689', '385', '747', '1175', 'j', 'U', 'k']

A: 10497
****
Q: 4, 9, ['F', '9103', 'K', 'P', '7867', '7145', 'f', 'w', '9393', 'O', '213', 'H', 'E', 'e', 'z', '2485', '1341', 'E', 'U']

A:
24405
****