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, ['1173', '4647', 'g', 'H', '2899', 'f', '7265', '4709', '7775', 'l', 'R', '869', '1603', '6103', '5407', 'q', 'F', '971', 'C', '4961', 'z', 'D', '9127', 'H', '2917', '7393', '9933', 'a', 'v', '5955']