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: 6, 16, ['P', '8933', '2757', 'y', 'p', '6687', '6903', 'S', 'b', '7221', 'V', 'B', '3633', 'G', '1209', 'J', '641', '1449', 's', 'w', 'C', '5801', 'Y']

A: 25653
****
Q: 8, 9, ['P', 'V', '5567', 'm', 'V', '9533', '2381', '1095', '835', 'B', 'z', 'J', 'H', 't', 'b', 'z', 'e']

A: 1930
****
Q: 4, 13, ['9517', 'v', 'V', '8223', '7765', '3903', 'd', '7987', 'i', '895', '791', '4253', 's', '4253', '5545', 'r', '9097', 'N', 'E', '519', 'F', '9851', '1783']

A:
33817
****