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: 5, 6, ['6675', '1045', '5697', '8385', 'R', '8979', '2187', 'L', 'w', '9711', 'e', '9789', 'f', 'c', 'C', '8189', '131', '8163']

A: 8979
****
Q: 1, 2, ['9769', 'z', '6349', 't', '9391', '7181', '2405', 'j']

A: 9769
****
Q: 1, 2, ['5143', '5955', '9873', '305']

A:
11098
****