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: 9, 21, ['Z', 'Z', '853', '8745', 'L', '4401', 'a', 'L', '8237', 'h', '9163', '1891', '5049', '7075', '1437', '7377', 'E', 't', '837', 'B', 'z', '5629', 'm', 'z', '365', 'M', '8877', '27']

A: 41066
****
Q: 2, 3, ['E', '7611', '2621', '3237']

A: 10232
****
Q: 2, 19, ['8773', '4887', 'J', '1947', 'C', '7309', '6755', 'J', '2239', 'd', '1711', 'q', 'k', '501', '8045', '319', 'O', '4445', 'L', 'V', '9177', '539']

A:
38158
****