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.
19, 21, ['279', 'w', 'o', '5123', 'J', 'L', '4449', '7755', '9613', 'r', '111', 'm', '1069', '9123', 'U', '6865', '8199', '8123', '7689', 'M', 'D', 'd', 'r', 'l']