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.
13, 19, ['7965', '2525', 'f', 'Q', '9511', 'z', '407', '7715', 'K', '9709', '1805', '1083', '183', 'q', '5407', '1649', '4797', 'm', '7215', '8685', '1115', 'W', '8937']