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, 19, ['R', 'X', '2665', 'I', '2315', '6605', '5037', 't', '3155', '9973', 'p', '1679', 'H', 'C', 'X', '8359', 'E', '5773', 'I', 'h']