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: 5, 9, ['6337', 'o', '5881', 'w', 'R', 'M', 'z', 'y', 'W']

A: 0
****
Q: 9, 9, ['379', 'Q', '5147', '9559', '809', '2539', '5843', 'x', 'a', 'K', 'R', 'B', 'Z']

A:
0
****