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, 15, ['t', '77', '6593', '3683', '5673', '9391', 'Y', 'A', '3273', '379', '6569', 'l', 'u', '8633', 'M', '8587', '3127', '5885', '4083']

A: 44271
****
Q: 2, 9, ['4437', 'g', 'I', 'u', '4299', '45', '4397', '5327', '5301', 'J', 'K', '4129', 'W', '8567']

A: 19369
****
Q: 5, 7, ['9125', 'T', 'J', '8795', 'C', '3081', '967', '6267', 'W', 'g', '3599', 'w']

A:
4048
****