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, 12, ['6001', '6723', '1813', 'S', '3331', 'T', '297', '8105', '7529', 'f', '1459', '323', '8077', 'N', 'W', 'G', 's', 'z', '7559', 't', 'F', 'h', '3771', '975']

A: 9311
****
Q: 5, 11, ['9535', 'L', '5957', 'm', 'B', 'W', '2105', '4959', 'f', '395', 'a', 'W', 'C']

A: 7459
****
Q: 6, 19, ['2207', '9047', '3429', '9511', 'm', 't', '8153', 'a', '6805', '1773', 'E', 'q', 'L', 'c', 'l', 'C', '6553', 'z', '4381', '5827', '3011']

A:
27665
****