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, 16, ['r', '7723', 'c', '4923', 'o', '4075', 'e', '4777', 'T', 'x', 'Q', '6665', 'k', 'T', '2697', '7305', 'S', '491', 'B', 'z', '1967', 'b', '9431', '5101']