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, 3, ['e', '1703', 'x', 'U', '873']

A: 1703
****
Q: 2, 25, ['R', 'g', '5585', '1059', '3917', '8711', 'K', 'C', 'o', '4587', '7493', 'P', 'B', '5951', 'd', 'b', 'B', '851', 'S', '4589', 'P', '1471', 'Z', 'x', '9477']

A: 53691
****
Q: 10, 11, ['Z', '9137', '8325', '5169', 'u', '5907', '2935', 'n', '9607', '8695', '4133', '4599', 'i']

A:
12828
****