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, 6, ['u', 'L', 'm', '9283', 'e', '4615', '7815', '7185', 'h', 'h', '8985', '3987', '1521', 'k', '5715', 'd', 'w', 'T']

A: 13898
****
Q: 5, 9, ['1523', 'C', 'd', 'I', '6913', '5553', '2769', '767', 'v', '231', 'I', 'p', '9033', 'H', '2007', 'g', '5837', 'Z']

A: 16002
****
Q: 24, 26, ['9595', 'k', '2389', 'G', 'm', '5673', '9075', 'q', '8567', '1607', 'b', '8429', '8423', '723', '2961', '521', '4765', 'Z', '375', 'D', 'f', 'n', 'd', 'x', 'A', '6931']

A:
6931
****