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.
15, 16, ['C', 'l', '8629', 'y', '8021', '8003', 'U', '2195', '4201', '6225', '9601', '4393', 'M', '4465', 'x', '1769', '6753', 'w', 'Q', '3653', 'r', '3641', 'z', '3845']