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, 6, ['j', 'j', 'W', '1351', 'B', 'e', '2585', '8831', '7465']

A: 1351
****
Q: 19, 21, ['y', '9403', 'C', '389', '5521', '9271', 'W', 'B', '3613', 'w', '2741', 'H', '8305', '727', '7641', '5857', '9183', '1297', 'p', '7371', 'b']

A: 7371
****
Q: 9, 15, ['555', '5109', 'H', '8527', 'c', '779', 'i', '7821', 'E', 'N', '6799', 'l', '227', '8167', 'B', 'd', 'b']

A:
15193
****