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: 4, 17, ['n', 'U', 'b', '6139', '4187', '757', '2059', '5677', 'O', 'n', '73', 'F', '2573', 'K', 'I', '8921', '1483', 'C', '319', '7525', 'X', '3031', 'A', '6693', 'q', '549', 'N']

A: 31869
****
Q: 1, 7, ['173', '5875', 'C', '7417', '3565', '1949', '537', '7707', 'o', 'y']

A: 19516
****
Q: 1, 11, ['q', '1693', '8147', 'a', 'S', '4589', 'W', 'm', '3563', 'o', 'S', '457']

A:
17992
****