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.
5, 24, ['o', '1967', 'h', '4143', 'E', 'b', '6315', 'O', 'P', 'M', '4837', 'o', 'I', '4587', '7511', 'W', '2679', 'e', 'k', '8733', '5079', 'Y', 'R', '3895', 'Z', '9311', '6559', 'E', 'C']