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, 17, ['s', 'S', 'i', '3491', 'r', '7025', 'O', 'C', 'K', 'A', '4795', 'L', 'i', '2717', '5553', 'E', '2961', '1241', 'F', 'P', '1877', 'g', '9461', '5845', 'X', 'W']