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.
9, 19, ['Y', '501', 'J', '3991', '9247', 'l', 'a', 'q', '5453', 'O', 'm', '2811', '207', '7301', 'y', '8865', '8153', 'b', 'b', '5157', 'd', '2397', '6877', 'J']