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.
5, 13, ['3415', 'l', '645', '2827', '3665', '6253', 'O', '2825', '7533', '3133', '9473', '4619', 'X', '9437', '3207', 'p', 'j', '5811', 'z', '959', 'M', 'O', 'a']