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', 'M', 'w', 'x', 'b', 'F', '2011', '4785', '1921', 'J', '7495', 'H', 'l', 'x', '6455', '3517', 'H', '2141', '591', 'J', '909', '5791', '7923', '9915', '1865', 'l', '5529', 'b', 'l', '7809']