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.
4, 11, ['m', '7271', 'V', 't', 'C', 'M', '9643', 'y', 'L', 'y', '4491', 'g', 'H', '6507', '953', '9811', '3271', 'a', '1405', '9641', '9017', 'D', '7873', '5671', 'U']