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.
18, 19, ['9907', '6405', 'O', 'h', 'Y', 'J', '8065', '4155', 'E', 'G', 'w', '6405', 'b', 'Q', 'q', '6001', '9623', '937', 'm', 'c', '8643', 'w', 'Y', 'g', '4903', 'U', 'g', 'b']