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, 12, ['m', 'f', 'y', '2363', '9555', 'E', 'm', 'J', '1977', 'z', '3733', '9745', 'm', 'u', '1033', 'x', '7351', 'O', 'W', '8311', '955', '8643', 'D', 'e', 'z', 'M', '5139', 'o', 'a']

A: 27373
****
Q: 2, 8, ['4517', 'w', '9145', '5477', '7679', 'j', '8603', 'z']

A: 30904
****
Q: 8, 9, ['l', '573', '1421', '123', '8643', '5063', '8853', 'V', '4129', 'i', '8553']

A:
4129
****