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: 3, 7, ['1687', '1929', '3189', '3277', 'L', 'b', 'x', '3181', 'C', 'w', 'A', 't', 'I', '3421']

A: 6466
****
Q: 8, 9, ['1329', '3107', 's', 'z', '2013', '1633', 'i', '1229', '4201', 'M', '3127']

A: 5430
****
Q: 4, 8, ['1081', 'u', '5667', 'I', 'i', '3545', 'c', 'D', 'A', 'N']

A:
3545
****