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.
6, 12, ['3679', '6737', '3629', '1609', 'L', '9431', '909', '4153', '8941', 'e', 'm', 'i', '6415', 'C', '8473', '8609', '227', 'H', 'h', 'r', '6291', 'y', '4439', 'E']