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: 12, 14, ['U', '5071', 'V', '9887', 'E', '3913', '3459', 'l', 'V', 'n', 'B', '655', 'L', 's', '2687', '9761', '2477', 'D', '8385', 'U', 'm', 'q', '4365', 'j']

A: 655
****
Q: 18, 24, ['3493', 'T', '2499', 'l', '543', 'Y', '2247', '2665', 'y', 'z', 'a', 'H', '1057', '2401', '5587', 'w', 'N', 'n', 's', 'H', 'u', 'N', '757', 'u', 'R']

A: 757
****
Q: 3, 23, ['B', 'J', 'H', 'W', 'M', 'b', 'j', '2377', '7371', 'q', 'g', 'X', '6141', 'e', 'y', '9683', '8809', 'V', 'E', 'y', 'X', '195', '837', '6489', 's', 'L', '1275', 'E']

A:
35413
****