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, 6, ['I', '8721', '6901', '737', '5767', '9771', 'h']

A: 9771
****
Q: 11, 15, ['W', '8193', '2581', 'f', 'j', '5727', 'A', '6177', 'u', '4201', 'T', 'w', 'C', 'u', '7973', 'd', 'c']

A: 7973
****
Q: 3, 5, ['1845', 't', '269', 'd', 'y', 'd', '601', '6545', 'X', '7479', '6735', 'd', 'c']

A:
269
****