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.
2, 17, ['6951', '5333', '1841', '9255', '2685', 'm', 'A', 'F', '1147', 'Q', '477', '4351', 'M', '1557', '6903', 'U', 'a', 'L', 'D', 'z']