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, 7, ['7999', '9549', '8299', 't', '9311', '2385', 'B', 'x', '565', 'C', '6531', 'A', '5949', 'H']

A: 37543
****
Q: 4, 4, ['Y', 'X', 'r', '439', 'D', 'H', '1903']

A: 439
****
Q: 5, 14, ['b', '1081', 'u', '8177', '9505', '3573', 'G', '6133', 'R', '9551', '4503', 'd', 'u', 'b', '5333', 'q', 'e', '3559', 'z', 'V', 'U']

A:
33265
****