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, ['C', 'C', '9639', '7815', 'N', '1713', '8339', '4237']

A: 27506
****
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: 12, 25, ['w', '5213', 'g', 'j', 'X', '5597', '8403', 'N', '1551', '955', 'Y', 'P', 'e', '479', 'N', '2143', '7735', 'f', '5253', 'p', 'Y', 'v', 'd', '3007', 'c']

A:
18617
****