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.
4, 9, ['g', 'I', 'O', '7167', 'H', '9811', 'V', '6559', 'f', 'b', '3475', 'G', '6899', 'Q', 'P', 'F', '5795', '4547', '2655', '2567', '4437', 'E', 'd', '9333', '4419']