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: 2, 15, ['l', '5597', 'M', 'l', '6065', '7949', 'e', '433', '8159', 'N', 'Z', '5597', 's', 'k', '6973', '8387', 'n', 'W', '9895']

A: 40773
****
Q: 2, 2, ['8149', '7123', 'c', 'X', '1659']

A: 7123
****
Q: 4, 5, ['r', '7469', '8633', 'I', '8151', 'W', '4517']

A:
8151
****