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, 9, ['J', '5177', 'm', '7413', 'T', 'N', '5153', 'S', '8145']

A: 13298
****
Q: 9, 16, ['u', '81', '19', '5877', 'F', '6479', 'v', '4187', 'M', 'a', '4309', 'z', 'u', '55', 'w', 'W', '7471', 'b', 'k', 'W', '8785', 'y', 'n', 'q', 'G']

A: 4364
****
Q: 13, 13, ['4299', '4075', '1095', '6181', '8379', 'i', '417', 'C', 'K', '9693', 'z', 'u', 'j', 'B', 'V', '1553']

A:
0
****